On induced matchings

DOI10.1016/0012-365X(93)90590-PzbMath0787.05079MaRDI QIDQ687143

Angelika Steger, Min-Li Yu

Publication date: 19 May 1994

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

zbMATH Keywords

bipartite graphmatchings

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items

Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs ⋮ On the strong chromatic index of sparse graphs ⋮ The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs ⋮ Strong edge-coloring of cubic bipartite graphs: a counterexample ⋮ Strong chromatic index of graphs with maximum degree four ⋮ Induced matchings in subcubic graphs without short cycles ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ The strong clique index of a graph with forbidden cycles ⋮ Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ Strong edge chromatic index of the generalized Petersen graphs ⋮ Unnamed Item ⋮ Proper edge-colorings with a rich neighbor requirement ⋮ Hypergraph incidence coloring ⋮ A note on the strong chromatic index of bipartite graphs ⋮ Approximability results for the maximum and minimum maximal induced matching problems ⋮ Strong chromatic index of subcubic planar multigraphs ⋮ Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs ⋮ The strong chromatic index of \((3,\Delta)\)-bipartite graphs ⋮ On isomorphic linear partitions in cubic graphs ⋮ On isomorphic linear partitions in cubic graphs ⋮ On distance-3 matchings and induced matchings ⋮ The strong edge-coloring for graphs with small edge weight ⋮ Strong edge-coloring of planar graphs ⋮ On Distance-3 Matchings and Induced Matchings ⋮ Recent progress on strong edge-coloring of graphs ⋮ Θ-graphs of partial cubes and strong edge colorings ⋮ Maximum induced matchings of random cubic graphs

Cites Work

• Unnamed Item
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• Induced matchings in bipartite graphs
• Problems and results in combinatorial analysis and graph theory
• The strong chromatic index of a cubic graph is at most 10