List proper connection of 2-edge-connected graphs

MaRDI QIDQ6644889zbMATH OpenFDO

Authors Jakub Kwaśny, Marcin Stawiski

Publication date 28 November 2024

Published in The Australasian Journal of Combinatorics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

zbMATH Keywords

proper coloringproper connection

Mathematics Subject Classification ID

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

Recommendations

• Proper connection number 2, connectivity, and forbidden subgraphs
• Proper connection and size of graphs
• The proper 2-connection number of several graph classes
• The proper 2-connection number and size of graphs
• Proper connection with many colors

Cites work

• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• Degree sums and proper connection number of graphs
• List-colourings of graphs
• Minimum degree condition for proper connection number 2
• Minimum degree conditions for the proper connection number of graphs
• On Graphs with Proper Connection Number 2
• On the minimum degree and the proper connection number of graphs
• On two conjectures about the proper connection number of graphs
• Proper connection number of random graphs
• Proper connection of graphs
• The list chromatic index of a bipartite multigraph

This page was built for publication: List proper connection of 2-edge-connected graphs

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