On strong proper connection number of cubic graphs

DOI10.1016/j.dam.2019.03.014zbMath1416.05159OpenAlexW2929598537WikidataQ128122333 ScholiaQ128122333MaRDI QIDQ2312653

Jinjiang Yuan, Fei Huang

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

edge coloringcubic graphforced edgeforced branchstrong proper connection number

Mathematics Subject Classification ID

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

Related Items (4)

Two sufficient conditions for 2-connected graphs to have proper connection number 2 ⋮ Proper‐walk connection number of graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Strong conflict-free connection of graphs

Cites Work

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

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