Pages that link to "Item:Q2433734"
From MaRDI portal
The following pages link to Strong edge-coloring of graphs with maximum degree 4 using 22 colors (Q2433734):
Displaying 48 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)
- Strong edge coloring sparse graphs (Q324370) (← links)
- Lower bounds on the complexity of \(\mathsf{MSO}_1\) model-checking (Q395003) (← links)
- On strong list edge coloring of subcubic graphs (Q400392) (← links)
- Strong edge-coloring for cubic Halin graphs (Q408187) (← links)
- Strong chromatic index of planar graphs with large girth (Q472129) (← links)
- Strong edge-colorings for \(k\)-degenerate graphs (Q497384) (← 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)
- Strong chromatic index of \(K_{1, t}\)-free graphs (Q777360) (← links)
- The strong chromatic index of a class of graphs (Q998363) (← links)
- The strong chromatic index of complete cubic Halin graphs (Q1021818) (← 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)
- List strong edge coloring of planar graphs with maximum degree 4 (Q1732781) (← links)
- A note on strong edge coloring of sparse graphs (Q1734962) (← links)
- Strong list-chromatic index of subcubic graphs (Q1800415) (← links)
- Distance two edge labelings of lattices (Q1956249) (← links)
- Proof of a conjecture on the strong chromatic index of Halin graphs (Q2043362) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- List strong edge-coloring of graphs with maximum degree 4 (Q2174601) (← links)
- Odd graph and its applications to the strong edge coloring (Q2279245) (← links)
- Strong edge-coloring of pseudo-Halin graphs (Q2302063) (← links)
- Strong edge-colorings of sparse graphs with large maximum degree (Q2408965) (← links)
- Strong chromatic index of \(K_4\)-minor free graphs (Q2410582) (← 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)
- (Q4990127) (← links)
- $t$-Strong Cliques and the Degree-Diameter Problem (Q5020846) (← links)
- 子立方平面图的$(1,0)$-松弛强边列表染色 (Q5037961) (← links)
- Recent progress on strong edge-coloring of graphs (Q5242836) (← links)
- Induced Matchings in Graphs of Degree at Most 4 (Q5743551) (← links)
- The strong clique index of a graph with forbidden cycles (Q6056786) (← links)
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth (Q6080127) (← links)
- The tight bound for the strong chromatic indices of claw-free subcubic graphs (Q6115426) (← links)
- On strong edge-coloring of graphs with maximum degree 5 (Q6180572) (← links)
- Strong edge coloring of subquartic graphs (Q6606224) (← links)
- \(t\)-strong cliques and the degree-diameter problem (Q6621265) (← links)
