A note onn-extendable graphs

DOI10.1002/JGT.3190160408MaRDI QIDQ4014274zbMATH OpenOpenAlexFDO

Authors Qinglin Roger Yu

Publication date 5 October 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190160408

zbMATH Keywords

\(n\)-extendable graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cited in

(15)

• Two recursive theorems on \(n\)-extendibility
• Connectivity of \(k\)-extendable graphs with large \(k\).
• Minimal graphs for 2-factor extension
• Trivially extendable graphs
• A novel characterization of n-extendable bipartite graphs.
• On the extendability of I-graphs
• On (n,k)-extendable graphs and induced subgraphs
• scientific article; zbMATH DE number 1263931 (Why is no real title available?)
• scientific article; zbMATH DE number 637272 (Why is no real title available?)
• scientific article; zbMATH DE number 734454 (Why is no real title available?)
• scientific article; zbMATH DE number 736426 (Why is no real title available?)
• scientific article; zbMATH DE number 786151 (Why is no real title available?)
• Countable \(\alpha\)-extendable graphs
• Removable and forced subgraphs of graphs
• A characterization of maximal non-\(k\)-factor-critical graphs

This page was built for publication: A note onn-extendable graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4014274)