A note onn-extendable graphs

DOI10.1002/JGT.3190160408zbMATH Open0773.05086OpenAlexW1941677206MaRDI QIDQ4014274FDOQ4014274

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

Recommendations

• scientific article; zbMATH DE number 734454
• scientific article; zbMATH DE number 969186
• scientific article; zbMATH DE number 637272
• scientific article; zbMATH DE number 2186984
• scientific article; zbMATH DE number 238423

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 (13)

• On the extendability of I-graphs
• A characterization of maximal non-\(k\)-factor-critical graphs
• Countable \(\alpha\)-extendable graphs
• Title not available (Why is that?)
• A novel characterization of \(n\)-extendable bipartite graphs.
• Minimal graphs for 2-factor extension
• On (n,k)-extendable graphs and induced subgraphs
• Removable and forced subgraphs of graphs
• Title not available (Why is that?)
• Trivially extendable graphs
• Connectivity of \(k\)-extendable graphs with large \(k\).
• Title not available (Why is that?)
• Title not available (Why is that?)

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)