Two sufficient conditions for 2-connected graphs to have proper connection number 2

DOI10.1007/S40840-019-00868-9MaRDI QIDQ2186294zbMATHOpenAlexWikidataFDO

Authors F. Huang, Jinjiang Yuan, Shanshan Guo

Publication date 9 June 2020

Published in Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s40840-019-00868-9

zbMATH Keywords

edge-coloring2-connected graphproper connection numberproper path

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40)

Recommendations

• Proper connection number 2, connectivity, and forbidden subgraphs
• Minimum degree conditions for the proper connection number of graphs
• On the minimum degree and the proper connection number of graphs
• On Graphs with Proper Connection Number 2
• Degree sum conditions for graphs to have proper connection number 2.

Cites work

• scientific article; zbMATH DE number 4049453 (Why is no real title available?)
• scientific article; zbMATH DE number 762736 (Why is no real title available?)
• Graph theory
• Hamiltonian circuits determining the order of chromosomes
• Maintaining bridge-connected and biconnected components on-line
• Minimum degree conditions for the proper connection number of graphs
• On proper-path colorings in graphs
• On strong proper connection number of cubic graphs
• On two conjectures about the proper connection number of graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• Proper connection of graphs
• Properly colored connectivity of graphs
• Rainbow connection in graphs
• Upper bounds of proper connection number of graphs

Cited in

(6)

• On Graphs with Proper Connection Number 2
• The proper 2-connection number and size of graphs
• Proper connection number 2, connectivity, and forbidden subgraphs
• Minimum degree condition for proper connection number 2
• The proper 2-connection number of several graph classes
• On the (di)graphs with (directed) proper connection number two

This page was built for publication: Two sufficient conditions for 2-connected graphs to have proper connection number 2

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