From combinatorial problems to graph colorings

MaRDI QIDQ2927762zbMATH OpenFDO

Authors Eric Andrews, Chira Lumduanhom, Ping Zhang

Publication date 4 November 2014

Published in JCMCC. The Journal of Combinatorial Mathematics and Combinatorial Computing (Search for Journal in Brave)

zbMATH Keywords

neighbor-distinguishing coloringvertex-distinguishing coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 25263
• The complexity of some graph colouring problems
• The \(a\)-graph coloring problem
• Sur le coloriage des graphs
• From puzzles to graphs to colorings
• Colored problems in graphs
• scientific article; zbMATH DE number 3308988
• The coloring of graphs
• scientific article; zbMATH DE number 5972368

Cited in

(3)

• From puzzles to graphs to colorings
• scientific article; zbMATH DE number 5722310 (Why is no real title available?)
• Combinatorial Nullstellensatz

This page was built for publication: From combinatorial problems to graph colorings

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