Induced matchings in bipartite graphs
From MaRDI portal
Publication:921017
DOI10.1016/0012-365X(89)90163-5zbMath0709.05026OpenAlexW2065003601MaRDI QIDQ921017
Zsolt Tuza, András Gyárfás, Ralph J. Faudree, Richard H. Schelp
Publication date: 1989
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(89)90163-5
Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
Clique number of the square of a line graph, Colouring graphs with sparse neighbourhoods: bounds and applications, A polynomial time algorithm for strong edge coloring of partial \(k\)-trees, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, A bound on the strong chromatic index of a graph, A stronger bound for the strong chromatic index (extended abstract), Strong edge coloring sparse graphs, Induced matching extendable graph powers, \(r\)-strong edge colorings of graphs, Unnamed Item, Unnamed Item, Unnamed Item, Maximum induced matchings in graphs, Problems on cycles and colorings, Induced matchings in subcubic graphs without short cycles, Matchings, coverings, and Castelnuovo-Mumford regularity, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Maximum Induced Matchings in Grids, Unnamed Item, A Stronger Bound for the Strong Chromatic Index, Hypergraph incidence coloring, Strong edge colouring of subcubic graphs, Strong edge-colouring and induced matchings, Randomly colouring graphs (a combinatorial view), On the strong chromatic index of cyclic multigraphs, Unnamed Item, Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier, The strong chromatic index of sparse graphs, A note on the strong chromatic index of bipartite graphs, Degree conditions of induced matching extendable graphs, On induced matchings, The strong chromatic index of a cubic graph is at most 10, The Distance-t Chromatic Index of Graphs, Fractional strong chromatic index of bipartite graphs, Strong Chromatic Index of 2-Degenerate Graphs, Unnamed Item, Distance edge-colourings and matchings, On distance-3 matchings and induced matchings, Generalized subgraph-restricted matchings in graphs, The strong chromatic index ofC4-free graphs, 4-regular claw-free IM-extendable graphs, Strong cliques and forbidden cycles, Strong cliques in claw-free graphs, On Distance-3 Matchings and Induced Matchings, Approximating maximum uniquely restricted matchings in bipartite graphs, Brambles and independent packings in chordal graphs, On distance edge-colourings and matchings, Independent packings in structured graphs, Incidence and strong edge colorings of graphs, Θ-graphs of partial cubes and strong edge colorings, $t$-Strong Cliques and the Degree-Diameter Problem, On the computational complexity of strong edge coloring, On a topological relaxation of a conjecture of Erdős and Nešetřil, Strong edge coloring of Cayley graphs and some product graphs, Maximum induced matchings of random cubic graphs
Cites Work
