Characterizations of graphs having large proper connection numbers
From MaRDI portal
Publication:274703
DOI10.7151/dmgt.1867zbMath1338.05088MaRDI 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
05C38: Paths and cycles
05C75: Structural characterization of families of graphs
05C15: Coloring of graphs and hypergraphs
Related Items
On the (di)graphs with (directed) proper connection number two, On the (di)graphs with (directed) proper connection number two, Proper‐walk connection number of graphs, On (strong) proper vertex-connection of graphs, Some upper bounds for the 3-proper index of graphs, The \(k\)-proper index of graphs, Graphs with conflict-free connection number two, Hardness results for three kinds of colored connections of graphs, On the total proper connection of graphs, Note on directed proper connection number of a random graph, The proper diameter of a graph, On strong proper connection number of cubic graphs, Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
Cites Work
