𝔖 Bobbio Scriptorium
✦   LIBER   ✦

-free graphs with no odd holes

✍ Scribed by Maria Chudnovsky; Neil Robertson; Paul Seymour; Robin Thomas

Book ID
108167477
Publisher
Elsevier Science
Year
2010
Tongue
English
Weight
293 KB
Volume
100
Category
Article
ISSN
0095-8956

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

K4-free graphs with no odd hole: Even pa
K4-free graphs with no odd hole: Even pairs and the circular chromatic number
✍ Yori Zwols 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 219 KB

An odd hole in a graph is an induced cycle of odd length at least five. In this article we show that every imperfect K 4 -free graph with no odd hole either is one of two basic graphs, or has an even pair or a clique cutset. We use this result to show that every K 4 -free graph with no odd hole has

Even and odd holes in cap-free graphs
Even and odd holes in cap-free graphs
✍ Conforti, Michele; Cornu�jols, G�rard; Kapoor, Ajai; Vu?kovi?, Kristina 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 158 KB 👁 1 views

It is an old problem in graph theory to test whether a graph contains a chordless cycle of length greater than three (hole) with a specific parity (even, odd). Studying the structure of graphs without odd holes has obvious implications for Berge's strong perfect graph conjecture that states that a g

Complexity of clique-coloring odd-hole-f
Complexity of clique-coloring odd-hole-free graphs
✍ David Défossez 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 155 KB

## Abstract In this paper we investigate the problem of clique‐coloring, which consists in coloring the vertices of a graph in such a way that no monochromatic maximal clique appears, and we focus on odd‐hole‐free graphs. On the one hand we do not know any odd‐hole‐free graph that is not 3‐clique‐c

Coloring graphs with no odd-K4
Coloring graphs with no odd-K4
✍ Wenan Zang 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 350 KB

The purpose of this note is to present a polynomial-time algorithm which, given an arbitrary graph G as its input, finds either a proper 3-coloring of G or an odd-K4 that is a subgraph of G in time O(mn), where m and n stand for the number of edges and the number of vertices of G, respectively. (~

Decomposition of odd-hole-free graphs by
Decomposition of odd-hole-free graphs by double star cutsets and 2-joins
✍ Michele Conforti; Gérard Cornuéjols; Kristina Vušković 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 644 KB

In this paper we decompose odd-hole-free graphs (graphs that do not contain as an induced subgraph a chordless cycle of odd length greater than three) with double star cutsets and 2-joins into bipartite graphs, line graphs of bipartite graphs and the complements of line graphs of bipartite graphs.