From connectivity to coloring

MaRDI QIDQ4590886zbMATH OpenFDO

Authors Gary Chartrand, Teresa W. Haynes, Stephen T. Hedetniemi, Ping Zhang

Publication date 20 November 2017

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• The connectivity of minimal imperfect graphs
• On \(k\)-partitioning of Hamming graphs
• scientific article; zbMATH DE number 2058456
• Graphs with the smallest number of minimum cut sets
• Separation of Cartesian products of graphs into several connected components by the removal of vertices

Cited in

(2)

• Connecting colored point sets
• From puzzles to graphs to colorings

This page was built for publication: From connectivity to coloring

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