Minimum degree and size conditions for the proper connection number of graphs

DOI10.1016/J.AMC.2019.01.062zbMath1428.05166arXiv1806.09452OpenAlexW2811228059WikidataQ128311050 ScholiaQ128311050MaRDI QIDQ2010690

Eddie Cheng, Lina Xue, Weihua Yang, Xiaxia Guan

Publication date: 27 November 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1806.09452

zbMATH Keywords

minimum degreeproper connection numberedge number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (1)

Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)

Cites Work

• Unnamed Item
• Unnamed Item
• Proper connection of graphs
• Total rainbow connection of digraphs
• Rainbow vertex connection of digraphs
• Rainbow connections of graphs: a survey
• On two conjectures about the proper connection number of graphs
• Proper connection and size of graphs
• 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
• Some Theorems on Abstract Graphs

This page was built for publication: Minimum degree and size conditions for the proper connection number of graphs