Coloring the hypergraph of maximal cliques of a graph with no long path
From MaRDI portal
Publication:1412673
DOI10.1016/S0012-365X(03)00197-3zbMath1028.05033MaRDI QIDQ1412673
Frédéric Maffray, Sylvain Gravier, Chính T. Hoàng
Publication date: 25 November 2003
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items (36)
The adjacency matrix of a graph as a data table: a geometric perspective ⋮ Vizing bound for the chromatic number on some graph classes ⋮ List coloring in the absence of two subgraphs ⋮ Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs ⋮ Colouring square-free graphs without long induced paths. ⋮ More Results on Clique-chromatic Numbers of Graphs with No Long Path ⋮ On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ Colouring of graphs with Ramsey-type forbidden subgraphs ⋮ THE CHROMATIC NUMBER OF -FREE GRAPHS ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ Coloring graphs without induced \(P_5\) or \(K_5-e\) ⋮ Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs ⋮ Perfect graphs of arbitrarily large clique-chromatic number ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ Strengthening Brooks' chromatic bound on \(P_6\)-free graphs ⋮ Disjointness graphs of short polygonal chains ⋮ Coloring (\(P_5\), kite)-free graphs with small cliques ⋮ Star coloring of certain graph classes ⋮ A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Clique colourings of geometric graphs ⋮ Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) ⋮ Complexity of clique coloring and related problems ⋮ Stable sets in \(k\)-colorable \(P_{5}\)-free graphs ⋮ Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Colouring clique-hypergraphs of circulant graphs ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ $(2P_2,K_4)$-Free Graphs are 4-Colorable ⋮ A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS ⋮ Complexity of clique-coloring odd-hole-free graphs ⋮ Colouring square-free graphs without long induced paths ⋮ Coloring of \((P_5, 4\)-wheel)-free graphs
Cites Work
This page was built for publication: Coloring the hypergraph of maximal cliques of a graph with no long path
