The following pages link to Induced matchings in cubic graphs (Q4693353):
Displayed 50 items.
- 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)
- Problems on cycles and colorings (Q383772) (← links)
- Induced matchings in subcubic graphs without short cycles (Q393187) (← links)
- On strong list edge coloring of subcubic graphs (Q400392) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- The strong chromatic index of Halin graphs (Q411659) (← links)
- On the strong chromatic index of cubic Halin graphs (Q419099) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colouring of sparse planar graphs (Q477354) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← links)
- Strong chromatic index of subcubic planar multigraphs (Q499491) (← links)
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs (Q501082) (← links)
- On \((s,t)\)-relaxed strong edge-coloring of graphs (Q511712) (← links)
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 (Q519218) (← links)
- Fractional strong chromatic index of bipartite graphs (Q526231) (← links)
- On distance-3 matchings and induced matchings (Q716178) (← links)
- A note on the strong chromatic index of bipartite graphs (Q932702) (← links)
- The strong chromatic index of a class of graphs (Q998363) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← links)
- Brambles and independent packings in chordal graphs (Q1045070) (← links)
- Incidence and strong edge colorings of graphs (Q1313849) (← links)
- A bound on the strong chromatic index of a graph (Q1354718) (← links)
- A lower bound on the acyclic matching number of subcubic graphs (Q1637156) (← links)
- On the precise value of the strong chromatic index of a planar graph with a large girth (Q1671365) (← links)
- Strong chromatic index of graphs with maximum degree four (Q1671652) (← links)
- On strong edge-coloring of graphs with maximum degree 4 (Q1682888) (← links)
- Upper bounds for the strong chromatic index of Halin graphs (Q1692620) (← links)
- Degenerate matchings and edge colorings (Q1706114) (← links)
- List strong edge coloring of planar graphs with maximum degree 4 (Q1732781) (← links)
- A note on strong edge coloring of sparse graphs (Q1734962) (← links)
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable (Q1744746) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- On the strong chromatic index of cyclic multigraphs (Q1962032) (← links)
- Degree conditions of induced matching extendable graphs (Q1976446) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- Approximating maximum uniquely restricted matchings in bipartite graphs (Q2322866) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- Strong chromatic index of \(K_4\)-minor free graphs (Q2410582) (← links)
- Strong edge chromatic index of the generalized Petersen graphs (Q2423067) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← links)
- Independent packings in structured graphs (Q2583122) (← links)
- Strong Chromatic Index of Sparse Graphs (Q2833251) (← links)
- Strong edge-coloring of subcubic planar graphs (Q2966513) (← links)
- Squared Chromatic Number Without Claws or Large Cliques (Q3121310) (← links)
- On Distance-3 Matchings and Induced Matchings (Q3655145) (← links)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- (Q4691867) (← links)