Induced matchings in subcubic planar graphs
DOI10.1137/100808824zbMATH Open1256.05191OpenAlexW4230263834MaRDI QIDQ4899067FDOQ4899067
Authors: Ross J. Kang, Matthias Mnich, Tobias Müller 
Publication date: 4 January 2013
Published in: SIAM Journal on Discrete Mathematics (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
Recommendations
Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cited In (14)
- Induced matchings in subcubic graphs without short cycles
- Induced Matchings in Graphs of Degree at Most 4
- Total dominating sequences in graphs
- Induced Matching in Some Subclasses of Bipartite Graphs
- Approximating weighted induced matchings
- On induced subgraphs of the cube
- Induced matchings in subcubic planar graphs
- Degenerate matchings and edge colorings
- Total dominating sequences in trees, split graphs, and under modular decomposition
- Maximal induced matchings in \(K_4\)-free and \(K_5\)-free graphs
- Moderately exponential time algorithms for the maximum induced matching problem
- Strong chromatic index of subcubic planar multigraphs
- Induced matchings in intersection graphs.
- Approximating maximum uniquely restricted matchings in bipartite 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 Q4899067)
