On strong proper connection number of cubic graphs

DOI10.1016/J.DAM.2019.03.014MaRDI QIDQ2312653zbMATH OpenOpenAlexWikidataFDO

Authors F. Huang, Jinjiang Yuan

Publication date 17 July 2019

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2019.03.014

zbMATH Keywords

cubic graphedge coloringforced branchforced edgestrong proper connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• The proper (vertex) connection numbers of cubic graphs
• Characterizations of graphs having large proper connection numbers
• On proper-path colorings in graphs
• Proper connection with many colors
• On the (di)graphs with (directed) proper connection number two

Cites work

• Characterizations of graphs having large proper connection numbers
• Edge-coloring bipartite multigraphs in \(O(E \log D)\) time
• Graph theory
• NP completeness of finding the chromatic index of regular graphs
• On proper-path colorings in graphs
• On rainbow connection
• Proper connection number and connected dominating sets
• Proper connection of graphs
• Rainbow connection in graphs
• The NP-Completeness of Edge-Coloring
• Upper bounds of proper connection number of graphs

Cited in

(8)

• Two sufficient conditions for 2-connected graphs to have proper connection number 2
• Hardness results for three kinds of colored connections of graphs
• Strong conflict-free connection of graphs
• An 11-vertex theorem for 3-connected cubic graphs
• Proper‐walk connection number of graphs
• Some results on (strong) total proper connection number of some digraphs
• Strongly proper connected coloring of graphs
• Revisit the coloring problem of Gallai graphs

This page was built for publication: On strong proper connection number of cubic graphs

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