Deficiency and forbidden subgraphs of connected, locally-connected graphs

DOI10.7151/dmgt.2121zbMath1430.05067OpenAlexW2811344728WikidataQ129586963 ScholiaQ129586963MaRDI QIDQ2282473

Xihe Li, Li-Gong Wang

Publication date: 8 January 2020

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2121

zbMATH Keywords

matchingdeficiencyforbidden subgraphlocally-connected graph

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Lower bounds for locally highly connected graphs
• Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability
• The Ryjáček closure and a forbidden subgraph
• Claw-free graphs---a survey
• Quasilocally Connected, Almost Locally Connected Or Triangularly Connected Claw-Free Graphs
• On partitioning the edges of graphs into connected subgraphs
• Every connected, locally connected nontrivial graph with no induced claw is hamiltonian
• 1-Factors and Antifactor Sets
• Locally connected graphs
• Forbidden subgraphs and bounds on the size of a maximum matching

This page was built for publication: Deficiency and forbidden subgraphs of connected, locally-connected graphs