On Minimum Spanning Subgraphs of Graphs With Proper Connection Number 2

DOI10.20429/TAG.2017.030202MaRDI QIDQ5225527zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

proper-path coloringproper connection number

Mathematics Subject Classification ID

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

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

Cited in

(5)

• Minimum Weight 2-Edge-Connected Spanning Subgraphs in Planar Graphs
• 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
• Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\)
• scientific article; zbMATH DE number 3987314 (Why is no real title available?)
• Proper connection number 2, connectivity, and forbidden subgraphs

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)