On the divisibility of graphs
From MaRDI portal
Publication:5957752
DOI10.1016/S0012-365X(01)00054-1zbMath0988.05068OpenAlexW1992400796MaRDI QIDQ5957752
Chính T. Hoàng, Colin J. H. McDiarmid
Publication date: 24 June 2002
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0012-365x(01)00054-1
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Perfect graphs (05C17)
Related Items (24)
Tight bounds on the clique chromatic number ⋮ Clique-coloring claw-free graphs ⋮ On the structure of certain intersection graphs ⋮ 2-divisibility of some odd hole free graphs ⋮ On the stability properties of linear dynamic time-varying unforced systems involving switches between parameterizations from topologic considerations via graph theory ⋮ Coloring graph classes with no induced fork via perfect divisibility ⋮ Some problems on induced subgraphs ⋮ Divisibility and coloring of some \(P_5\)-free graphs ⋮ Graphs of large chromatic number ⋮ Coloring the hypergraph of maximal cliques of a graph with no long path ⋮ Clique-transversal sets and clique-coloring in planar graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Subgraph-avoiding coloring of graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ A linear-time algorithm for clique-coloring problem in circular-arc graphs ⋮ \(K_{4}\)-free graphs with no odd holes ⋮ Complexity of clique coloring and related problems ⋮ Chromatic bounds for some classes of \(2 K_2\)-free graphs ⋮ Structure and colour in triangle-free graphs ⋮ A linear-time algorithm for clique-coloring planar graphs ⋮ List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly ⋮ Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs ⋮ The strong perfect graph conjecture: 40 years of attempts, and its resolution ⋮ The clique-perfectness and clique-coloring of outer-planar graphs
This page was built for publication: On the divisibility of graphs
