Pages that link to "Item:Q1292236"

The following pages link to The Grötzsch theorem for the hypergraph of maximal cliques (Q1292236):

Displaying 34 items.

• Polychromatic 4-coloring of cubic bipartite plane graphs (Q409414) (← links)
• Coloring clique-hypergraphs of graphs with no subdivision of \(K_5\) (Q500982) (← links)
• A linear-time algorithm for clique-coloring problem in circular-arc graphs (Q512872) (← links)
• Box-respecting colorings of \(n\)-dimensional guillotine-partitions (Q533787) (← links)
• Complexity of clique coloring and related problems (Q551168) (← links)
• Clique colourings of geometric graphs (Q668027) (← links)
• Tight bounds on the clique chromatic number (Q820840) (← links)
• Clique-coloring of \(K_{3,3}\)-minor free graphs (Q826557) (← links)
• Structural parameterizations of clique coloring (Q832512) (← links)
• Perfect graphs of arbitrarily large clique-chromatic number (Q896010) (← links)
• 2-list-coloring planar graphs without monochromatic triangles (Q958693) (← links)
• Polychromatic 4-coloring of guillotine subdivisions (Q989455) (← links)
• Polychromatic colorings of rectangular partitions (Q1043659) (← links)
• Polychromatic colorings of arbitrary rectangular partitions (Q1045138) (← links)
• Coloring face-hypergraphs of graphs on surfaces (Q1850616) (← links)
• Balanced polychromatic 2-coloring of triangulations (Q2062902) (← links)
• On the complexity of local-equitable coloring of graphs (Q2077396) (← links)
• A generalization of Grötzsch Theorem on the local-equitable coloring (Q2110276) (← links)
• Polychromatic colorings of hypergraphs with high balance (Q2129929) (← links)
• A linear-time algorithm for clique-coloring planar graphs (Q2294308) (← links)
• List-coloring clique-hypergraphs of \(K_5\)-minor-free graphs strongly (Q2297730) (← links)
• The clique-perfectness and clique-coloring of outer-planar graphs (Q2331588) (← links)
• Facially-constrained colorings of plane graphs: a survey (Q2401805) (← links)
• Clique-transversal sets and clique-coloring in planar graphs (Q2441644) (← links)
• Clique-coloring claw-free graphs (Q2631088) (← links)
• Equitable clique-coloring in claw-free graphs with maximum degree at most 4 (Q2657098) (← links)
• Graphs with large clique-chromatic numbers (Q2788733) (← links)
• Subgraph-avoiding coloring of graphs (Q3553235) (← links)
• Polychromatic colorings of bounded degree plane graphs (Q3633009) (← links)
• (Q5089217) (← links)
• A note on polychromatic colorings of plane graphs (Q5866030) (← links)
• Polychromatic colorings of plane graphs (Q5896961) (← links)
• Tight asymptotics of clique‐chromatic numbers of dense random graphs (Q6074590) (← links)
• The jump of the clique chromatic number of random graphs (Q6076219) (← links)