Matching extension and the genus of a graph
From MaRDI portal
Publication:1107545
DOI10.1016/0095-8956(88)90041-XzbMATH Open0653.05054OpenAlexW2985639584MaRDI QIDQ1107545FDOQ1107545
Authors: Michael D. Plummer
Publication date: 1988
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(88)90041-x
Recommendations
- Generalization of matching extensions in graphs
- Matchings and matching extensions in graphs
- Generalization of matching extensions in graphs. II.
- scientific article; zbMATH DE number 19207
- Matchings, cycle bases, and the maximum genus of a graph
- scientific article; zbMATH DE number 969113
- Generalization of matching extensions in graphs. III
- scientific article; zbMATH DE number 238423
- scientific article; zbMATH DE number 434908
- scientific article; zbMATH DE number 1563920
Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Ear-decompositions of matching-covered graphs
- Matching theory
- Graph theory with applications
- Title not available (Why is that?)
- On n-extendable graphs
- SOLUTION OF THE HEAWOOD MAP-COLORING PROBLEM
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- On minimal elementary bipartite graphs
- Title not available (Why is that?)
- On the relationship between the genus and the cardinality of the maximum matchings of a graph
- Heawood's theorem and connectivity
Cited In (27)
- The 2-extendability of 5-connected graphs on surfaces with large representativity
- On the restricted matching extension of graphs on the torus and the Klein bottle
- Title not available (Why is that?)
- The distance matching extension in \(K_{1,k}\)-free graphs with high local connectedness
- On 2-extendable abelian Cayley graphs
- On the restricted matching extension of graphs in surfaces
- On restricted matching extension of 1-embeddable graphs in surfaces with small genus
- 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
- On 2-extendable quasi-abelian Cayley graphs
- Restricted matching in graphs of small genus
- Matching theory -- a sampler: From Dénes König to the present
- The matching extendability of surfaces
- On the matching extendability of graphs in surfaces
- The (\(n\), \(k\))-extendable graphs in surfaces
- Surface embedding of \((n,k)\)-extendable graphs
- Matching extension and distance spectral radius
- Toughness and matching extension in graphs
- Removal of subgraphs and perfect matchings in graphs on surfaces
- Some results on the matching extendability of graphs in surfaces
- Surface Embedding of Non-Bipartite $k$-Extendable Graphs
- Extending matchings in graphs: A survey
- On the extendability of certain semi-Cayley graphs of finite Abelian groups
- The maximum matching extendability and factor-criticality of 1-planar graphs
- On the \(p\)-factor-criticality of the Klein bottle
- Extending matchings in claw-free graphs
- Representations of graphs and networks (coding, layouts and embeddings)
This page was built for publication: Matching extension and the genus of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1107545)