The following pages link to On induced matchings (Q687143):
Displaying 29 items.
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs (Q512620) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- Approximability results for the maximum and minimum maximal induced matching problems (Q937401) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- On the strong chromatic index of sparse graphs (Q1658764) (← links)
- Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
- The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs (Q2172399) (← links)
- Strong edge-coloring of cubic bipartite graphs: a counterexample (Q2172406) (← links)
- The strong edge-coloring for graphs with small edge weight (Q2297732) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- Hypergraph incidence coloring (Q2689485) (← links)
- Θ-graphs of partial cubes and strong edge colorings (Q3439627) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- (Q5869351) (← links)
- On isomorphic linear partitions in cubic graphs (Q5899382) (← links)
- On isomorphic linear partitions in cubic graphs (Q5902338) (← links)
- Strong edge-coloring of planar graphs (Q5920291) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
- The strong clique index of a graph with forbidden cycles (Q6056786) (← links)
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable (Q6062875) (← links)
- Strong edge colorings of graphs and the covers of Kneser graphs (Q6081882) (← links)
- Proper edge-colorings with a rich neighbor requirement (Q6177411) (← links)
