✦ LIBER ✦

List-Coloring Claw-Free Graphs with Small Clique Number

✍ Scribed by Louis Esperet, András Gyárfás, Frédéric Maffray

Book ID: 120788811
Publisher: Springer Japan
Year: 2012
Tongue: English
Weight: 243 KB
Volume: 30
Category: Article
ISSN: 0911-0119
DOI: 10.1007/s00373-012-1272-x

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Dominating Coloring Number of Claw-free

Dominating Coloring Number of Claw-free Graphs

✍ Abdolghafurian, A.; Akbari, S.; Hossein Ghorban, S.; Qajar, S. 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 189 KB

Claw-free cubic graphs with clique-trans

Claw-free cubic graphs with clique-transversal number half of their order

✍ Erfang Shan; Haichao Wang 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 362 KB

A clique-transversal set D of a graph G is a set of vertices of G such that D meets all cliques of G. The clique-transversal number, denoted by τ C (G), is the minimum cardinality of a cliquetransversal set in G. In 2008, we showed that the clique-transversal number of every clawfree cubic graph is

Dense graphs with small clique number

✍ Wayne Goddard; Jeremy Lyle 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB

On the clique-transversal number in (cla

On the clique-transversal number in (claw,K4)-free 4-regular graphs

✍ Wang, Ding Guo; Shan, Er Fang; Liang, Zuo Song 📂 Article 📅 2013 🏛 Institute of Mathematics, Chinese Academy of Scien 🌐 English ⚖ 228 KB

Supereulerian graphs with small matching

Supereulerian graphs with small matching number and 2-connected hamiltonian claw-free graphs

✍ Xu, Jinquan; Li, Ping; Miao, Zhengke; Wang, Keke; Lai, Hong-Jian 📂 Article 📅 2014 🏛 Taylor and Francis Group 🌐 English ⚖ 244 KB

On coloring graphs with locally small ch

On coloring graphs with locally small chromatic number

✍ H. A. Kierstead; E. Szemerédi; W. T. Trotter 📂 Article 📅 1984 🏛 Springer-Verlag 🌐 English ⚖ 123 KB