Restricted matching in graphs of small genus

DOI10.1016/J.DISC.2007.11.001MaRDI QIDQ998321zbMATH OpenOpenAlexFDO

Authors R. E. L. Aldred, Michael D. Plummer

Publication date 28 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.11.001

zbMATH Keywords

torusgenusKlein bottleprojective planerestricted matching

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Finite affine and projective planes (geometric aspects) (51E15)

Recommendations

• Matching extension and the genus of a graph
• Generalized subgraph-restricted matchings in graphs
• Bounding the size of equimatchable graphs of fixed genus
• Restricted \(b\)-matchings in degree-bounded graphs
• Matching for Graphs of Bounded Degree
• Matchings, cycle bases, and the maximum genus of a graph
• Graphs with restricted valency and matching number
• Smallest maximal matchings of graphs
• Perfect matchings and \(K_{1,p}\)-restricted graphs
• Uniquely restricted matchings in interval graphs

Cites work

• scientific article; zbMATH DE number 3877215 (Why is no real title available?)
• scientific article; zbMATH DE number 4212076 (Why is no real title available?)
• scientific article; zbMATH DE number 4047749 (Why is no real title available?)
• scientific article; zbMATH DE number 3179262 (Why is no real title available?)
• scientific article; zbMATH DE number 4118405 (Why is no real title available?)
• scientific article; zbMATH DE number 874216 (Why is no real title available?)
• scientific article; zbMATH DE number 3241107 (Why is no real title available?)
• scientific article; zbMATH DE number 3310750 (Why is no real title available?)
• Blocks and the nonorientable genus of graphs
• Counterexamples to the nonorientable genus conjecture for complete tripartite graphs
• Das Geschlecht des vollständigen paaren Graphen
• Der vollständige paare Graph auf nichtorientierbaren Flächen.
• Extending matchings in planar graphs. IV
• On restricted matching extension in planar graphs
• The matching extendability of surfaces

Cited in

(14)

• On the restricted matching extension of graphs on the torus and the Klein bottle
• Proximity thresholds for matching extension in the torus and Klein bottle
• On the restricted matching extension of graphs in surfaces
• The 2-extendability of graphs on the projective plane, the torus and the Klein bottle
• On restricted matching extension of 1-embeddable graphs in surfaces with small genus
• Distance-restricted matching extension in planar triangulations
• The 2-extendability of 5-connected graphs on the Klein bottle
• On restricted matching extension in planar graphs
• A note on cyclic connectivity and matching properties of regular graphs
• Distance-restricted matching extension in triangulations of the torus and the Klein bottle
• Toughness, binding number and restricted matching extension in a graph
• Matching extension in toroidal quadrangulations. II: The 3-extendable case
• Proximity thresholds for matching extension in planar and projective planar triangulations
• Restricted 2-extendability of (3,6)-fullerenes

This page was built for publication: Restricted matching in graphs of small genus

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