Pages that link to "Item:Q2445264"
From MaRDI portal
The following pages link to Strong edge-colouring and induced matchings (Q2445264):
Displaying 17 items.
- Strong edge coloring sparse graphs (Q324370) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- On the complexity of the flow coloring problem (Q499367) (← links)
- A polynomial time algorithm for strong edge coloring of partial \(k\)-trees (Q1887062) (← links)
- Complexity and algorithms for injective edge-coloring in graphs (Q2032162) (← links)
- A characterization of well-indumatchable graphs having girth greater than seven (Q2172407) (← links)
- On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs (Q2253902) (← links)
- Strong chromatic index of \(K_4\)-minor free graphs (Q2410582) (← links)
- Bounds and complexity results for strong edge colouring of subcubic graphs (Q2857388) (← links)
- Semistrong edge coloring of graphs (Q4680403) (← links)
- Well-indumatched Trees and Graphs of Bounded Girth (Q5060441) (← links)
- Maximal induced matchings in triangle-free graphs (Q5891021) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
- Strong incidence coloring of outerplanar graphs (Q6110619) (← links)
- A note on strong edge-coloring of claw-free cubic graphs (Q6138357) (← links)
- (Q6162646) (← links)
- Strong Edge Coloring of Outerplane Graphs with Independent Crossings (Q6489818) (← links)