✦ LIBER ✦

Subdivisions and Chromatic Roots

✍ Scribed by Jason I. Brown

Publisher: Elsevier Science
Year: 1999
Tongue: English
Weight: 77 KB
Volume: 76
Category: Article
ISSN: 0095-8956
DOI: 10.1006/jctb.1999.1901

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Subdivisions and the chromatic index of

Subdivisions and the chromatic index of r-graphs

✍ K. Kilakos; F. B. Shepherd 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 625 KB

Let T2 be the graph obtained from the Petersen graph by first deleting a vertex and then contracting an edge incident to a vertex of degree two. We give a simple characterization of the graphs that contain no subdivision of T2. This characterization is used to show that if every planar r-graph is r-

Chromatic Roots and Hamiltonian Paths

✍ C. Thomassen 📂 Article 📅 2000 🏛 Elsevier Science 🌐 English ⚖ 89 KB

We present a new connection between colorings and hamiltonian paths: If the chromatic polynomial of a graph has a noninteger root less than or equal to then the graph has no hamiltonian path. This result is best possible in the sense that it becomes false if t 0 is replaced by any larger number.

On the Roots of Chromatic Polynomials

✍ Jason I. Brown 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 158 KB

It is proved that the chromatic polynomial of a connected graph with n vertices and m edges has a root with modulus at least (m&1)Â(n&2); this bound is best possible for trees and 2-trees (only). It is also proved that the chromatic polynomial of a graph with few triangles that is not a forest has a

On the Chromatic Roots of Generalized Th

On the Chromatic Roots of Generalized Theta Graphs

✍ Jason I. Brown; Carl Hickman; Alan D. Sokal; David G. Wagner 📂 Article 📅 2001 🏛 Elsevier Science 🌐 English ⚖ 242 KB

The generalized theta graph G s1, ..., sk consists of a pair of endvertices joined by k internally disjoint paths of lengths s 1 , ..., s k \ 1. We prove that the roots of the chromatic polynomial p(G s1, ..., sk , z) of a k-ary generalized theta graph all lie in the disc |z -1| [ [1+o(1)] k/log k,

Subdivisions, parity and well-covered gr

Subdivisions, parity and well-covered graphs

✍ Caro, Yair 📂 Article 📅 1997 🏛 John Wiley and Sons 🌐 English ⚖ 121 KB 👁 2 views

A graph is well-covered if every maximal independent set is maximum. This concept, introduced by Plummer in 1970 (J. Combin. Theory 8 (1970)), is the focal point of much interest and current research. We consider well-covered 2-degenerate graphs and supply a structural (and polynomial time algorithm

Cycle-minors and subdivisions of wheels

✍ Galen E. Turner III 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 130 KB

## Abstract In this paper we prove two results. The first is an extension of a result of Dirac which says that any set of __n__ vertices of an __n__‐connected graph lies in a cycle. We prove that if __V__′ is a set of at most 2__n__ vertices in an __n__‐connected graph __G__, then __G__ has, as a m