High girth and extendability

DOI10.1016/0012-365X(95)00039-YMaRDI QIDQ1918540zbMATH OpenOpenAlexWikidataFDO

Authors Pavol Gvozdjak, J. Nešetřil

Publication date 13 January 1997

Published in Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

genusgirthperfect matchingextendability

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Matching extension and the genus of a graph
• Some results on the matching extendability of graphs in surfaces
• On the matching extendability of graphs in surfaces
• The (\(n\), \(k\))-extendable graphs in surfaces

Cites work

• scientific article; zbMATH DE number 3451870 (Why is no real title available?)
• scientific article; zbMATH DE number 3189017 (Why is no real title available?)
• A hypergraph-free construction of highly chromatic graphs without short cycles
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• Explicit constructions of graphs without short cycles and low density codes
• Extending partial systems of distinct representatives
• Extending subpermutation matrices in regular classes of matrices
• On chromatic number of finite set-systems
• On n-extendable graphs
• Ramanujan graphs
• The Cartesian product of a \(k\)-extendable and an \(l\)-extendable graph is \((k+l+1)\)-extendable
• The matching extendability of surfaces

This page was built for publication: High girth and extendability

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