The strong chromatic index of a cubic graph is at most 10
From MaRDI portal
Publication:1201255
DOI10.1016/0012-365X(92)90678-9zbMath0756.05050OpenAlexW2035019112MaRDI QIDQ1201255
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
Related Items
Between Proper and Strong Edge-Colorings of Subcubic Graphs, The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs, The strong equitable vertex 2-arboricity of complete bipartite and tripartite graphs, A bound on the strong chromatic index of a graph, A stronger bound for the strong chromatic index (extended abstract), Strong edge coloring sparse graphs, On the strong chromatic index of sparse graphs, Strong edge-coloring of cubic bipartite graphs: a counterexample, On the precise value of the strong chromatic index of a planar graph with a large girth, Strong chromatic index of graphs with maximum degree four, List strong edge-coloring of graphs with maximum degree 4, Strong edge-colorings of sparse graphs with large maximum degree, Strong chromatic index of \(K_4\)-minor free graphs, Problems on cycles and colorings, Induced matchings in subcubic graphs without short cycles, On strong edge-coloring of graphs with maximum degree 4, Unnamed Item, Between proper and strong edge‐colorings of subcubic graphs, On strong list edge coloring of subcubic graphs, The strong clique index of a graph with forbidden cycles, Every subcubic multigraph is (1,27) $(1,{2}^{7})$‐packing edge‐colorable, Proper conflict-free list-coloring, odd minors, subdivisions, and layered treewidth, Strong edge colorings of graphs and the covers of Kneser graphs, Strong list-chromatic index of planar graphs with Ore-degree at most seven, List strong edge-colorings of sparse graphs, Strong edge-coloring for cubic Halin graphs, Strong edge chromatic index of the generalized Petersen graphs, Strong edge-coloring of 2-degenerate graphs, Strong incidence coloring of outerplanar graphs, The strong chromatic index of Halin graphs, The tight bound for the strong chromatic indices of claw-free subcubic graphs, Injective edge-coloring of subcubic graphs, Upper bounds for the strong chromatic index of Halin graphs, A note on strong edge-coloring of claw-free cubic graphs, On the strong chromatic index of cubic Halin graphs, A Stronger Bound for the Strong Chromatic Index, Proper edge-colorings with a rich neighbor requirement, 子立方平面图的$(1,0)$-松弛强边列表染色, On strong edge-coloring of graphs with maximum degree 5, Minimize the maximum duty in multi-interface networks, Strong edge-coloring of subcubic planar graphs, Strong edge-coloring of graphs with maximum degree 4 using 22 colors, Degenerate matchings and edge colorings, Distance two edge labelings of lattices, On strong edge-colouring of subcubic graphs, Unnamed Item, On the strong chromatic index of cyclic multigraphs, Strong list edge coloring of subcubic graphs, Strong chromatic index of planar graphs with large girth, Strong edge-colouring of sparse planar graphs, A note on the strong chromatic index of bipartite graphs, List strong edge coloring of planar graphs with maximum degree 4, A note on strong edge coloring of sparse graphs, On \(S\)-packing edge-colorings of cubic graphs, Strong edge-colorings for \(k\)-degenerate graphs, Strong chromatic index of subcubic planar multigraphs, Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs, Planar graphs with maximum degree 4 are strongly 19-edge-colorable, On \((s,t)\)-relaxed strong edge-coloring of graphs, A note on the strong edge-coloring of outerplanar graphs with maximum degree 3, On isomorphic linear partitions in cubic graphs, On induced matchings, On isomorphic linear partitions in cubic graphs, Fractional strong chromatic index of bipartite graphs, Induced Matchings in Graphs of Degree at Most 4, Odd graph and its applications to the strong edge coloring, The strong chromatic index of a class of graphs, Induced matchings in cubic graphs, Variations on the Petersen colouring conjecture, Strong edge-coloring for jellyfish graphs, (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6, Strong list-chromatic index of subcubic graphs, Proof of a conjecture on the strong chromatic index of Halin graphs, The strong edge-coloring for graphs with small edge weight, Strong edge-coloring of pseudo-Halin graphs, Strong cliques in claw-free graphs, Strong edge-coloring of planar graphs, Strong edge-coloring of planar graphs, Normal 6-edge-colorings of some bridgeless cubic graphs, The strong chromatic index of complete cubic Halin graphs, Strong Chromatic Index of Sparse Graphs, Bounding the strong chromatic index of dense random graphs, Recent progress on strong edge-coloring of graphs, Squared Chromatic Number Without Claws or Large Cliques, Strong edge-colorings of sparse graphs with \(3\Delta-1\) colors, From edge-coloring to strong edge-coloring, Normal 5-edge-colorings of a family of Loupekhine snarks, From light edges to strong edge-colouring of 1-planar graphs, Incidence and strong edge colorings of graphs, $t$-Strong Cliques and the Degree-Diameter Problem, Strong edge coloring of Cayley graphs and some product graphs, On strong edge-coloring of claw-free subcubic graphs
Cites Work
