✦ LIBER ✦

Vertex insertion approximates the crossing number of apex graphs

✍ Scribed by Markus Chimani; Petr Hliněný; Petra Mutzel

Book ID: 113582396
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 273 KB
Volume: 33
Category: Article
ISSN: 0195-6698
DOI: 10.1016/j.ejc.2011.09.009

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The crossing numbers of products of 5-ve

The crossing numbers of products of 5-vertex graphs with cycles

✍ Marián Klešč; Anna Kocúrová 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 251 KB

The crossing numbers of Cartesian produc

The crossing numbers of Cartesian products of paths with 5-vertex graphs

✍ Marián Klešč 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 122 KB

On the Crossing Number of Complete Graph

On the Crossing Number of Complete Graphs

✍ O. Aichholzer; F. Aurenhammer; H. Krasser 📂 Article 📅 2005 🏛 Springer Vienna 🌐 English ⚖ 135 KB

The Hadwiger number of infinite vertex-t

The Hadwiger number of infinite vertex-transitive graphs

✍ Carsten Thomassen 📂 Article 📅 1992 🏛 Springer-Verlag 🌐 English ⚖ 679 KB

The vertex-face total chromatic number o

The vertex-face total chromatic number of Halin graphs

✍ Lam, Peter C. B.; Zhang, Zhongfu 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 69 KB 👁 2 views

In this paper, we shall first prove that for a Halin graph G, 4 °xT (G) °6, where x T (G) is the vertex-face total chromatic number of G. Second, we shall establish a sufficient condition for a Halin graph to have a vertex-face total chromatic number of 6. Finally, we shall give a necessary and suff

The vertex (edge) independence number, v

The vertex (edge) independence number, vertex (edge) cover number and the least eigenvalue of a graph

✍ Ying-Ying Tan; Yi-Zheng Fan 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 151 KB