On color-connected graphs

MaRDI QIDQ3166001zbMATH OpenFDO

Authors Ryan Jones, Kyle Kolasinski, Chira Lumduanhom, Ping Zhang

Publication date 21 October 2012

zbMATH Keywords

connectivity of graphsdistance in graphsedge-coloring of graphssimple graphs

Mathematics Subject Classification ID

Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Recommendations

• Color-distance in color-connected graphs
• Proper connection with many colors
• Proper connection and size of graphs
• Proper connection of graphs
• scientific article; zbMATH DE number 1146221

Cited in

(10)

• Hard-to-color graphs for connected sequential colorings
• Coloring hypergraphs of low connectivity
• On connectivities of edge-colored graphs
• On properly colored Hamiltonian cycles in cubes of distance-colored grids
• Okhuma graphs and coloured chains
• On the Hamiltonicity of distance-colored graphs
• scientific article; zbMATH DE number 1146221 (Why is no real title available?)
• Coloring Graphs with Constraints on Connectivity
• On distance local connectivity and vertex distance colouring
• Color-distance in color-connected graphs

This page was built for publication: On color-connected graphs

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