Clique-relaxed graph coloring

DOI10.2140/INVOLVE.2011.4.127zbMATH Open1233.05101OpenAlexW2063548688MaRDI QIDQ656032FDOQ656032

Authors: Charles Dunn, Jennifer Firkins Nordstrom, Cassandra Naymie, Erin Pitney, William Sehorn, Charlie Suer 

Publication date: 26 January 2012

Published in: Involve (Search for Journal in Brave)

Full work available at URL: http://msp.berkeley.edu/involve/2011/4-2/p03.xhtml

Recommendations

• Relaxed coloring of a graph
• Relaxed approximate coloring in exact maximum clique search
• scientific article; zbMATH DE number 7559420
• Structural parameterizations of clique coloring
• Coloring the cliques of line graphs
• Clique-coloring claw-free graphs
• Complexity of clique coloring and related problems
• Reducing graph coloring to clique search
• Coloring the Maximal Cliques of Graphs
• Colouring clique-hypergraphs of circulant graphs

zbMATH Keywords

cliqueouterplanar graphcompetitive coloringrelaxed coloring

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15)

Cited In (6)

• The relaxed game chromatic number of outerplanar graphs
• Introduction to competitive graph coloring
• Reducing graph coloring to clique search
• On \(t\)-relaxed 2-distant circular coloring of graphs
• Title not available (Why is that?)
• Structural parameterizations of clique coloring

This page was built for publication: Clique-relaxed graph coloring

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q656032)