Characterizations of graphs having large proper connection numbers

DOI10.7151/dmgt.1867zbMath1338.05088OpenAlexW2323097292MaRDI QIDQ274703

Chira Lumduanhom, Elliot Laforge, Ping Zhang

Publication date: 25 April 2016

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.1867

zbMATH Keywords

edge coloringproper-path coloringstrong proper-path coloring

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items (13)

Proper‐walk connection number of graphs ⋮ On (strong) proper vertex-connection of graphs ⋮ Hardness results for three kinds of colored connections of graphs ⋮ Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) ⋮ Some upper bounds for the 3-proper index of graphs ⋮ The \(k\)-proper index of graphs ⋮ Graphs with conflict-free connection number two ⋮ On the total proper connection of graphs ⋮ Note on directed proper connection number of a random graph ⋮ The proper diameter of a graph ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On the (di)graphs with (directed) proper connection number two ⋮ On strong proper connection number of cubic graphs

Cites Work

• Rainbow connections of graphs: a survey
• Characterize graphs with rainbow connection number $m-2$ and $m-3$
• Rainbow connection in graphs
• Chromatic Graph Theory
• Unnamed Item
• Unnamed Item

This page was built for publication: Characterizations of graphs having large proper connection numbers