𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Colouring vertices of triangle-free graphs without forests

✍ Scribed by Konrad K. Dabrowski; Vadim Lozin; Rajiv Raman; Bernard Ries

Book ID
113567550
Publisher
Elsevier Science
Year
2012
Tongue
English
Weight
314 KB
Volume
312
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Graphs without large triangle free subgr
Graphs without large triangle free subgraphs
✍ B. BollobΓ‘s; H.R. Hind πŸ“‚ Article πŸ“… 1991 πŸ› Elsevier Science 🌐 English βš– 751 KB

Bollobas, B. and H.R. Hind, Graphs without large triangle free subgraphs, Discrete Mathematics 87 (1991) 119-131. The main aim of the paper is to show that for 2 < r <s and large enough n, there are graphs of order n and clique number less than s in which every set of vertices, which is not too sma

[Lecture Notes in Computer Science] Grap
[Lecture Notes in Computer Science] Graph Theoretic Concepts in Computer Science Volume 6410 || Colouring Vertices of Triangle-Free Graphs
✍ Thilikos, Dimitrios M. πŸ“‚ Article πŸ“… 2010 πŸ› Springer Berlin Heidelberg 🌐 English βš– 189 KB

The 36th International Workshop on Graph-Theoretic Concepts in Computer Science (WG 2010) took place in ZarΒ΄ os, Crete, Greece, June 28–30, 2010. About 60 mathematicians and computer scientists from all over the world (Australia, Canada, Czech Republic, France, Germany, Greece, Hungary, Israel, Japa

Triangle-free graphs that are signable w
Triangle-free graphs that are signable without even holes
✍ Michele Conforti; GΓ©rard CornuΓ©jols; Ajai Kapoor; Kristina VuΕ‘koviΔ‡ πŸ“‚ Article πŸ“… 2000 πŸ› John Wiley and Sons 🌐 English βš– 172 KB πŸ‘ 3 views