Pages that link to "Item:Q1412673"

The following pages link to Coloring the hypergraph of maximal cliques of a graph with no long path (Q1412673):

Displaying 36 items.

• Colouring of graphs with Ramsey-type forbidden subgraphs (Q393895) (← links)
• Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
• Complexity of clique coloring and related problems (Q551168) (← links)
• Clique colourings of geometric graphs (Q668027) (← links)
• Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
• Stable sets in \(k\)-colorable \(P_{5}\)-free graphs (Q990082) (← links)
• Star coloring of certain graph classes (Q1706426) (← links)
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
• Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
• Colouring square-free graphs without long induced paths (Q2323345) (← links)
• The adjacency matrix of a graph as a data table: a geometric perspective (Q2362877) (← links)
• On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
• Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
• List coloring in the absence of two subgraphs (Q2636800) (← links)
• Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
• A combinatorial game over biclique-hypergraphs of powers of paths and of powers of cycles through monochromatic transversals (Q2700612) (← links)
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
• Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable (Q2800540) (← links)
• More Results on Clique-chromatic Numbers of Graphs with No Long Path (Q2945676) (← links)
• A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
• Colouring square-free graphs without long induced paths. (Q3304134) (← links)
• Complexity of clique-coloring odd-hole-free graphs (Q3652547) (← links)
• Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
• $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
• A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874) (← links)
• Colouring clique-hypergraphs of circulant graphs (Q5900086) (← links)
• Colouring clique-hypergraphs of circulant graphs (Q5925222) (← links)
• THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
• On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
• Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
• Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
• Strengthening Brooks' chromatic bound on \(P_6\)-free graphs (Q6143873) (← links)
• Disjointness graphs of short polygonal chains (Q6144392) (← links)
• Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)