Induced matchings in subcubic planar graphs

DOI10.1007/978-3-642-15781-3_10MaRDI QIDQ3586388zbMATH OpenOpenAlexFDO

Authors Ross J. Kang, Matthias Mnich, Tobias Müller

Publication date 6 September 2010

Published in Algorithms – ESA 2010 (Search for Journal in Brave)

Full work available at URL https://research.tue.nl/nl/publications/induced-matchings-in-subcubic-planar-graphs(db2ca183-1f83-412d-9f4a-6c59bbaeef51).html

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) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• Induced matchings in subcubic planar graphs
• Induced matchings in subcubic graphs
• Induced matchings in subcubic graphs without short cycles
• Induced matchings in graphs of bounded maximum degree
• Improved induced matchings in sparse graphs

Cited in

(8)

• On induced subgraphs of the cube
• Induced matchings in intersection graphs.
• Induced Matching in Some Subclasses of Bipartite Graphs
• Improved induced matchings in sparse graphs
• Maximum matching in multi-interface networks
• Induced matchings in subcubic graphs without short cycles
• Induced matchings in subcubic planar graphs
• Induced matchings in subcubic graphs

This page was built for publication: Induced matchings in subcubic planar graphs

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