A local independence number condition for \(n\)-extendable graphs

DOI10.1016/S0012-365X(98)00181-2zbMath0928.05050MaRDI QIDQ1296992

Dingjun Lou

Publication date: 9 January 2000

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

zbMATH Keywords

independence number\(n\)-extendable graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Cites Work

• On n-extendable graphs
• Extending matchings in graphs: A survey
• Toughness and triangle-free graphs
• N‐extendability of symmetric graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: A local independence number condition for \(n\)-extendable graphs