The strong chromatic index of a cubic graph is at most 10
From MaRDI portal
Publication:1201255
DOI10.1016/0012-365X(92)90678-9zbMATH Open0756.05050OpenAlexW2035019112MaRDI QIDQ1201255FDOQ1201255
Authors: Lars Døvling Andersen 
Publication date: 17 January 1993
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0012-365x(92)90678-9
Recommendations
- The strong chromatic index of complete cubic Halin graphs
- On the strong chromatic index of cubic Halin graphs
- scientific article; zbMATH DE number 4187830
- The strong chromatic index of a class of graphs
- A bound on the strong chromatic index of a graph
- Strong chromatic index of graphs with maximum degree four
- Strong chromatic index of subcubic planar multigraphs
- Strong chromatic index of chordless graphs
- Publication:3201075
- Strong list-chromatic index of subcubic graphs
Cites Work
Cited In (95)
- Induced matchings in subcubic graphs without short cycles
- On strong list edge coloring of subcubic graphs
- On the strong chromatic index of cubic Halin graphs
- Strong list edge coloring of subcubic graphs
- The strong clique index of a graph with forbidden cycles
- List strong edge coloring of planar graphs with maximum degree 4
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- Strong edge-coloring for cubic Halin graphs
- Strong chromatic index of sparse graphs
- Strong edge-coloring of subcubic planar graphs
- The strong chromatic index of complete cubic Halin graphs
- On the precise value of the strong chromatic index of a planar graph with a large girth
- From edge-coloring to strong edge-coloring
- \(t\)-strong cliques and the degree-diameter problem
- Induced matchings in graphs of degree at most 4
- Induced matchings in cubic graphs
- Degenerate matchings and edge colorings
- Incidence and strong edge colorings of graphs
- A bound on the strong chromatic index of a graph
- The strong chromatic index of graphs and subdivisions
- Strong cliques in claw-free graphs
- Proof of a conjecture on the strong chromatic index of Halin graphs
- The strong chromatic index of Halin graphs
- On isomorphic linear partitions in cubic graphs
- Minimize the maximum duty in multi-interface networks
- Title not available (Why is that?)
- Bounding the strong chromatic index of dense random graphs
- A stronger bound for the strong chromatic index (extended abstract)
- Strong edge coloring sparse graphs
- On strong edge-colouring of subcubic graphs
- On induced matchings
- Strong edge-colouring of sparse planar graphs
- Strong chromatic index of planar graphs with large girth
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- A note on the strong chromatic index of bipartite graphs
- The strong chromatic index of a class of graphs
- On the strong chromatic index of cyclic multigraphs
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- On \(S\)-packing edge-colorings of cubic graphs
- List strong edge-colorings of sparse graphs
- Distance two edge labelings of lattices
- Strong edge-coloring of planar graphs
- Strong edge-coloring of planar graphs
- Odd graph and its applications to the strong edge coloring
- On strong edge-coloring of graphs with maximum degree 4
- Between proper and strong edge‐colorings of subcubic graphs
- Upper bounds for the strong chromatic index of Halin graphs
- Strong edge-colorings for \(k\)-degenerate graphs
- Strong chromatic index of subcubic planar multigraphs
- Strong edge-coloring for jellyfish graphs
- A note on strong edge coloring of sparse graphs
- Recent progress on strong edge-coloring of graphs
- A stronger bound for the strong chromatic index
- On the strong chromatic index of sparse graphs
- Strong chromatic index of graphs with maximum degree four
- On \((s,t)\)-relaxed strong edge-coloring of graphs
- A note on strong edge choosability of toroidal subcubic graphs
- Problems on cycles and colorings
- Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors
- Strong list-chromatic index of subcubic graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- A note on the strong edge-coloring of outerplanar graphs with maximum degree 3
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge coloring of Cayley graphs and some product graphs
- Fractional strong chromatic index of bipartite graphs
- Normal 5-edge-colorings of a family of Loupekhine snarks
- A note on strong edge-coloring of claw-free cubic graphs
- \((1, 0)\)-relaxed strong edge list coloring of planar graphs with girth \(6\)
- A \((1,0)\)-relaxed strong list coloring of planar subcubic graphs
- On strong edge-coloring of claw-free subcubic graphs
- List strong edge-coloring of graphs with maximum degree 4
- Squared chromatic number without claws or large cliques
- Strong edge coloring of subquartic graphs
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs
- Proper edge-colorings with a rich neighbor requirement
- On strong edge-coloring of graphs with maximum degree 5
- Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable
- On isomorphic linear partitions in cubic graphs
- \(t\)-strong cliques and the degree-diameter problem
- Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth
- Variations on the Petersen colouring conjecture
- Normal 6-edge-colorings of some bridgeless cubic graphs
- On an induced version of Menger's theorem
- Injective edge-coloring of subcubic graphs
- The strong edge-coloring for graphs with small edge weight
- Strong edge-coloring of pseudo-Halin graphs
- Strong list-chromatic index of planar graphs with Ore-degree at most seven
- Strong edge chromatic index of the generalized Petersen graphs
- Strong edge-coloring of cubic bipartite graphs: a counterexample
- From light edges to strong edge-colouring of 1-planar graphs
- Strong chromatic index of \(K_4\)-minor free graphs
- Strong incidence coloring of outerplanar graphs
- Strong edge-coloring of 2-degenerate graphs
- Strong edge colorings of graphs and the covers of Kneser graphs
- The tight bound for the strong chromatic indices of claw-free subcubic graphs
This page was built for publication: The strong chromatic index of a cubic graph is at most 10
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1201255)
