On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2

DOI10.20429/TAG.2017.030202zbMATH Open1416.05100OpenAlexW2568430394MaRDI QIDQ5225527FDOQ5225527

Authors: Zhenming Bi, Gary Chartrand, Ping Zhang, Garry Johns 

Publication date: 22 July 2019

Published in: Theory and Application of Graphs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.20429/tag.2017.030202

Recommendations

• Proper connection number 2, connectivity, and forbidden subgraphs
• Minimum degree condition for proper connection number 2
• The proper 2-connection number and size of graphs
• Proper connection and size of graphs
• Minimum degree and size conditions for the proper connection number of graphs

zbMATH Keywords

proper-path coloringproper connection number

Mathematics Subject Classification ID

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

Cited In (5)

• A proof of unimodality on the numbers of connected spanning subgraphs in an \(n\)-vertex graph with at least \(\left\lceil (3-2\sqrt 2) n^2 + n - \frac {7-2\sqrt 2}{2 \sqrt 2}\right\rceil\) edges
• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• Proper connection number 2, connectivity, and forbidden subgraphs
• Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
• Title not available (Why is that?)

This page was built for publication: On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5225527)