Induced Matchings in Subcubic Graphs
From MaRDI portal
Publication:4979850
DOI10.1137/130944424zbMath1293.05295arXiv1312.1110OpenAlexW2151752171MaRDI QIDQ4979850
Thomas Sasse, Dieter Rautenbach, Felix Joos
Publication date: 19 June 2014
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1312.1110
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (19)
Total dominating sequences in graphs ⋮ Acyclic matchings in graphs of bounded maximum degree ⋮ A lower bound on the acyclic matching number of subcubic graphs ⋮ Minimum maximal matchings in cubic graphs ⋮ A stronger bound for the strong chromatic index (extended abstract) ⋮ Total dominating sequences in trees, split graphs, and under modular decomposition ⋮ Perfect Italian domination on planar and regular graphs ⋮ A Stronger Bound for the Strong Chromatic Index ⋮ Degenerate matchings and edge colorings ⋮ Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier ⋮ Lower bounds on the uniquely restricted matching number ⋮ Two greedy consequences for maximum induced matchings ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ Approximating weighted induced matchings ⋮ Induced Matchings in Graphs of Degree at Most 4 ⋮ Approximating maximum acyclic matchings by greedy and local search strategies ⋮ Induced Matchings in Graphs of Bounded Maximum Degree ⋮ Approximating maximum uniquely restricted matchings in bipartite graphs ⋮ Recent progress on strong edge-coloring of graphs
This page was built for publication: Induced Matchings in Subcubic Graphs
