Pages that link to "Item:Q1201255"
From MaRDI portal
The following pages link to The strong chromatic index of a cubic graph is at most 10 (Q1201255):
Displaying 42 items.
- Normal 6-edge-colorings of some bridgeless cubic graphs (Q2306603) (← 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)
- Minimize the maximum duty in multi-interface networks (Q2429355) (← links)
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734) (← links)
- On strong edge-colouring of subcubic graphs (Q2444538) (← links)
- Strong edge-coloring for jellyfish graphs (Q2515576) (← 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)
- A Stronger Bound for the Strong Chromatic Index (Q4601050) (← links)
- Induced matchings in cubic graphs (Q4693353) (← links)
- (Q4990127) (← links)
- Normal 5-edge-colorings of a family of Loupekhine snarks (Q5012370) (← links)
- $t$-Strong Cliques and the Degree-Diameter Problem (Q5020846) (← links)
- 子立方平面图的$(1,0)$-松弛强边列表染色 (Q5037961) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- From light edges to strong edge-colouring of 1-planar graphs (Q5130733) (← links)
- (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6 (Q5207498) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← 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 (Q5920134) (← 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)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- Strong edge colorings of graphs and the covers of Kneser graphs (Q6081882) (← links)
- Strong list-chromatic index of planar graphs with Ore-degree at most seven (Q6083189) (← links)
- List strong edge-colorings of sparse graphs (Q6090823) (← links)
- Strong edge-coloring of 2-degenerate graphs (Q6103470) (← links)
- Strong incidence coloring of outerplanar graphs (Q6110619) (← links)
- The tight bound for the strong chromatic indices of claw-free subcubic graphs (Q6115426) (← links)
- Injective edge-coloring of subcubic graphs (Q6115745) (← links)
- A note on strong edge-coloring of claw-free cubic graphs (Q6138357) (← links)
- (Q6162646) (← links)
- Proper edge-colorings with a rich neighbor requirement (Q6177411) (← links)
- On strong edge-coloring of graphs with maximum degree 5 (Q6180572) (← links)
