Perfect divisibility and 2‐divisibility
From MaRDI portal
Publication:5379815
DOI10.1002/jgt.22367zbMath1414.05110arXiv1704.06667OpenAlexW2963548320MaRDI QIDQ5379815
Maria Chudnovsky, Vaidy Sivaraman
Publication date: 14 June 2019
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1704.06667
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (15)
On the chromatic number of some \(P_5\)-free graphs ⋮ 2-divisibility of some odd hole free graphs ⋮ Coloring graph classes with no induced fork via perfect divisibility ⋮ Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions ⋮ THE CHROMATIC NUMBER OF -FREE GRAPHS ⋮ On graphs with no induced five‐vertex path or paraglider ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ Divisibility and coloring of some \(P_5\)-free graphs ⋮ On the chromatic number of (P5,dart)-free graphs ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS ⋮ Coloring of \((P_5, 4\)-wheel)-free graphs
This page was built for publication: Perfect divisibility and 2‐divisibility
