Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs

DOI10.1007/S00373-010-0939-4zbMath1219.05127OpenAlexW1967100434MaRDI QIDQ1959719

Metrose Metsidik, Elkin Vumar

Publication date: 7 October 2010

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-010-0939-4

zbMATH Keywords

1-tough graphperfect matchingfactor-criticality\({\mathcal{P}_3}\)-dominated graphs\(p\)-extendable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

Toughness of the corona of two graphs ⋮ The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness

Cites Work

• Unnamed Item
• Unnamed Item
• On hamiltonicity of \(P_{3}\)-dominated graphs
• On n-extendable graphs
• Quasi-claw-free graphs
• Global insertion and Hamiltonicity in DCT-graphs
• On some intriguing problems in Hamiltonian graph theory---a survey
• Tough graphs and Hamiltonian circuits.
• 1-Factors and Antifactor Sets
• Factor-criticality and matching extension in DCT-graphs
• Almost claw‐free graphs
• Toughness and hamiltonicity in almost claw-free graphs
• The Factorization of Linear Graphs

This page was built for publication: Toughness and matching extension in \({\mathcal{P}_3}\)-dominated graphs