The proper 2-connection number and size of graphs

DOI10.1016/j.dam.2022.05.010OpenAlexW4283156057MaRDI QIDQ2166240

Ingo Schiermeyer, Trung Duy Doan

Publication date: 24 August 2022

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

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

zbMATH Keywords

edge-colouringsize of graphproper 2-connection number

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• A Dirac theorem for trestles
• Improved degree conditions for Hamiltonian properties
• Proper connection of graphs
• Proper connection number 2, connectivity, and forbidden subgraphs
• Rainbow connections of graphs: a survey
• Hardness results for three kinds of colored connections of graphs
• Proper connection and size of graphs
• Minimum degree conditions for the proper connection number of graphs
• The rainbow connectivity of a graph
• Graphs with rainbow connection number two
• Rainbow connection in graphs
• Maximal circuits of graphs. I

This page was built for publication: The proper 2-connection number and size of graphs