Matching extension and the genus of a graph
From MaRDI portal
Publication:1107545
DOI10.1016/0095-8956(88)90041-XzbMath0653.05054MaRDI QIDQ1107545
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
05C10: Planar graphs; geometric and topological aspects of graph theory
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
Related Items
The 2-extendability of 5-connected graphs on surfaces with large representativity, The 2-extendability of graphs on the projective plane, the torus and the Klein bottle, The 2-extendability of 5-connected graphs on the Klein bottle, The matching extendability of surfaces, Representations of graphs and networks (coding, layouts and embeddings), Matching theory -- a sampler: From Dénes König to the present, Extending matchings in graphs: A survey, Extending matchings in claw-free graphs, Toughness and matching extension in graphs, On the \(p\)-factor-criticality of the Klein bottle, On 2-extendable abelian Cayley graphs
Cites Work
- On the relationship between the genus and the cardinality of the maximum matchings of a graph
- Ear-decompositions of matching-covered graphs
- Matching theory
- On n-extendable graphs
- On minimal elementary bipartite graphs
- Heawood's theorem and connectivity
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
