Proper connection and size of graphs

DOI10.1016/j.disc.2016.09.021zbMath1369.05088OpenAlexW2549843525MaRDI QIDQ2401802

Ingo Schiermeyer, Christoph Brause, Marietjie Frick, Arnfried Kemnitz, Susan A. van Aardt, Alewyn P. Burger

Publication date: 5 September 2017

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

Full work available at URL: https://doi.org/10.1016/j.disc.2016.09.021

zbMATH Keywords

edge-colouringproper connection

Mathematics Subject Classification ID

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

Related Items

Some results on the total proper \(k\)-connection number, Conflict-free connections of graphs, The proper 2-connection number and size of graphs, Loose edge-connection of graphs, Conflict-free vertex connection number at most 3 and size of graphs, Graphs with conflict-free connection number two, Minimum degree and size conditions for the proper connection number of graphs, Odd connection and odd vertex-connection of graphs, From colourful to rainbow paths in graphs: colouring the vertices, Conflict-free connection number and size of graphs

Cites Work

• Unnamed Item
• Proper connection of graphs
• Rainbow connections of graphs: a survey
• Rainbow connection number of dense graphs
• Rainbow connection in sparse graphs
• Graphs with rainbow connection number two
• Note on Hamilton Circuits
• On maximal paths and circuits of graphs
• Rainbow connection in graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• Maximal circuits of graphs. I