Proper connection number 2, connectivity, and forbidden subgraphs

DOI10.1016/j.endm.2016.10.027zbMath1356.05073OpenAlexW2556954744MaRDI QIDQ510953

Trung Duy Doan, Ingo Schiermeyer, Christoph Brause

Publication date: 14 February 2017

Full work available at URL: https://doi.org/10.1016/j.endm.2016.10.027

zbMATH Keywords

forbidden subgraphs2-connectedproper connection number

Mathematics Subject Classification ID

Connectivity (05C40) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (3)

The proper 2-connection number and size of graphs ⋮ Proper‐walk connection number of graphs ⋮ (1, 2)-rainbow connection number at most 3 in connected dense graphs

Cites Work

• Unnamed Item
• Proper connection of graphs
• A characterization of Hamiltonian prisms

This page was built for publication: Proper connection number 2, connectivity, and forbidden subgraphs