Induced matchings in subcubic graphs without short cycles

DOI10.1016/j.disc.2013.10.009zbMath1279.05055MaRDI QIDQ393187

Dieter Rautenbach, Michael A. Henning

Publication date: 16 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

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

zbMATH Keywords

induced matching; strong chromatic index; strong matching

Mathematics Subject Classification ID

05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)

05C15: Coloring of graphs and hypergraphs

Cites Work

• Unnamed Item
• Improved induced matchings in sparse graphs
• On induced matchings
• On distance-3 matchings and induced matchings
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Induced matchings in bipartite graphs
• Matching theory
• NP-completeness of some generalizations of the maximum matching problem
• The strong chromatic index of a cubic graph is at most 10
• Induced matchings
• Incidence and strong edge colorings of graphs
• A bound on the strong chromatic index of a graph
• Induced matchings in intersection graphs.
• Maximum induced matchings of random cubic graphs
• Generalized subgraph-restricted matchings in graphs
• On maximum induced matchings in bipartite graphs
• Induced matchings in cubic graphs
• Induced Matchings in Subcubic Planar Graphs
• Paths, Trees, and Flowers
• The Factorization of Linear Graphs