Pages that link to "Item:Q921017"
From MaRDI portal
The following pages link to Induced matchings in bipartite graphs (Q921017):
Displaying 50 items.
- Clique number of the square of a line graph (Q271628) (← links)
- The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs (Q318921) (← links)
- A stronger bound for the strong chromatic index (extended abstract) (Q322242) (← links)
- Strong edge coloring sparse graphs (Q324370) (← links)
- Problems on cycles and colorings (Q383772) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- Matchings, coverings, and Castelnuovo-Mumford regularity (Q405389) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- The strong chromatic index of sparse graphs (Q477679) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- Strong edge colouring of subcubic graphs (Q642999) (← links)
- On induced matchings (Q687143) (← links)
- Distance edge-colourings and matchings (Q714033) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- Induced matching extendable graph powers (Q855304) (← links)
- \(r\)-strong edge colorings of graphs (Q856841) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- The strong chromatic index of a cubic graph is at most 10 (Q1201255) (← links)
- Incidence and strong edge colorings of graphs (Q1313849) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- Maximum induced matchings in graphs (Q1363677) (← links)
- On the computational complexity of strong edge coloring (Q1602692) (← links)
- Maximum induced matchings of random cubic graphs (Q1612292) (← links)
- Generalized subgraph-restricted matchings in graphs (Q1779490) (← links)
- 4-regular claw-free IM-extendable graphs (Q1781983) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- Degree conditions of induced matching extendable graphs (Q1976446) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- Linear programming based approximation for unweighted induced matchings -- breaking the \(\varDelta\) barrier (Q2218644) (← links)
- Strong cliques and forbidden cycles (Q2288223) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- On a topological relaxation of a conjecture of Erdős and Nešetřil (Q2349967) (← links)
- Strong edge-colouring and induced matchings (Q2445264) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Hypergraph incidence coloring (Q2689485) (← links)
- On distance edge-colourings and matchings (Q2851479) (← links)
- (Q2857388) (← links)
- (Q3391327) (← links)
- Θ-graphs of partial cubes and strong edge colorings (Q3439627) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- The strong chromatic index ofC4-free graphs (Q4521553) (← links)
- Maximum Induced Matchings in Grids (Q4596162) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- (Q4691867) (← links)
- (Q4691905) (← links)
- (Q4691914) (← links)
