Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors

DOI10.1016/j.jctb.2016.11.007zbMath1354.05045arXiv1512.03481OpenAlexW3098288776MaRDI QIDQ505914

Sang-il Oum, Ilkyoo Choi, O-joung Kwon

Publication date: 26 January 2017

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1512.03481

zbMATH Keywords

chromatic numberpivot-minorvertex-minorchi-bounded class

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15) Graph minors (05C83) Distance in graphs (05C12)

Related Items (5)

Rank-width: algorithmic and structural results ⋮ The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor ⋮ Graph theory. Abstracts from the workshop held January 2--8, 2022 ⋮ Chi-boundedness of graph classes excluding wheel vertex-minors ⋮ Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded

Cites Work

• Induced subgraphs of graphs with large chromatic number. II. Three steps towards Gyárfás' conjectures
• Induced subgraphs of graphs with large chromatic number. I. Odd holes
• Triangle-free intersection graphs of line segments with large chromatic number
• Classes of graphs with small rank decompositions are \(\chi \)-bounded
• Excluded vertex-minors for graphs of linear rank-width at most \(k\)
• The strong perfect graph theorem
• Bisimplicial vertices in even-hole-free graphs
• Distance-hereditary graphs
• Isotropic systems
• Graphic presentations of isotropic systems
• Reducing prime graphs and recognizing circle graphs
• On the extension of bipartite to parity graphs
• Circle graph obstructions
• Covering and coloring polygon-circle graphs
• Rank-width and well-quasi-ordering of skew-symmetric or symmetric matrices
• Graphs of small rank-width are pivot-minors of graphs of small tree-width
• Approximating clique-width and branch-width
• Rank-width and vertex-minors
• Excluding a bipartite circle graph from line graphs
• Rank-Width and Well-Quasi-Ordering
• Circle graph obstructions under pivoting
• Radius two trees specify χ‐bounded classes
• Radius Three Trees in Graphs with Large Chromatic Number
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors