Independence number in \(n\)-extendable graphs

DOI10.1016/0012-365X(95)00042-UzbMath0854.05086OpenAlexW2022904408WikidataQ127858071 ScholiaQ127858071MaRDI QIDQ1918549

Peter Maschlanka, Lutz Volkmann

Publication date: 5 January 1997

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00042-u

zbMATH Keywords

independence numberconnected graphperfect matchingsaturation number\(n\)-extendable graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Eulerian and Hamiltonian graphs (05C45)

Related Items (6)

Minimum size of \(n\)-factor-critical graphs and \(k\)-extendable graphs ⋮ Hamiltonian and long paths in bipartite graphs with connectivity ⋮ Hamiltonian cycle properties in \(k\)-extendable non-bipartite graphs with high connectivity ⋮ Saturation number of fullerene graphs ⋮ Counting perfect matchings in \(n\)-extendable graphs ⋮ Hamiltonian and long cycles in bipartite graphs with connectivity

Cites Work

• Matching theory
• On n-extendable graphs
• Extending matchings in graphs: A survey
• A note on Hamiltonian circuits
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independence number in \(n\)-extendable graphs