scientific article; zbMATH DE number 4187830
From MaRDI portal
Publication:5752590
zbMath0721.05018MaRDI QIDQ5752590
Ralph J. Faudree, A. Tuza, Richard H. Schelp, András Gyárfás
Publication date: 1990
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Extremal set theory (05D05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items (only showing first 100 items - show all)
Proper edge-colorings with a rich neighbor requirement ⋮ Revisiting semistrong edge‐coloring of graphs ⋮ Edge homogeneous colorings ⋮ Strong edge coloring of circle graphs ⋮ Clique number of the square of a line graph ⋮ Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ Strong edge-coloring for planar graphs with large girth ⋮ Induced and weak induced arboricities ⋮ A polynomial time algorithm for strong edge coloring of partial \(k\)-trees ⋮ Strong edge colorings of uniform graphs ⋮ The maximum size of an edge 2-neighborhood in \(P_5\)-free 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 ⋮ \(r\)-strong edge colorings of graphs ⋮ On the strong chromatic index of sparse graphs ⋮ Strong edge-coloring of cubic bipartite graphs: a counterexample ⋮ Facial \(L(2, 1)\)-edge-labelings of trees ⋮ 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 ⋮ Strong edge-colorings of sparse graphs with large maximum degree ⋮ Strong chromatic index of \(K_4\)-minor free graphs ⋮ List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs ⋮ Strong Chromatic Index of Chordless Graphs ⋮ Induced matchings in subcubic graphs without short cycles ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ The strong clique index of a graph with forbidden cycles ⋮ Strong chromatic index and Hadwiger number ⋮ Strong edge colorings of graphs and the covers of Kneser graphs ⋮ Strong list-chromatic index of planar graphs with Ore-degree at most seven ⋮ Strong edge-coloring for cubic Halin graphs ⋮ Strong edge chromatic index of the generalized Petersen 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 ⋮ Hypergraph incidence coloring ⋮ List star edge coloring of sparse graphs ⋮ Strong edge-coloring of subcubic planar graphs ⋮ Strong edge-coloring of graphs with maximum degree 4 using 22 colors ⋮ Degenerate matchings and edge colorings ⋮ Strong edge colouring of subcubic graphs ⋮ Distance two edge labelings of lattices ⋮ Distance-two coloring of sparse graphs ⋮ On strong edge-colouring of subcubic graphs ⋮ Strong edge-colouring and induced matchings ⋮ Randomly colouring graphs (a combinatorial view) ⋮ On the strong chromatic index of cyclic multigraphs ⋮ Strong chromatic index of planar graphs with large girth ⋮ Strong edge-colouring of sparse planar graphs ⋮ The strong chromatic index of sparse graphs ⋮ List strong edge coloring of planar graphs with maximum degree 4 ⋮ Tree-like distance colouring for planar graphs of sufficient girth ⋮ 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 ⋮ The strong chromatic index of \((3,\Delta)\)-bipartite graphs ⋮ A note on the strong edge-coloring of outerplanar graphs with maximum degree 3 ⋮ List star chromatic index of sparse graphs ⋮ On isomorphic linear partitions in cubic graphs ⋮ Cliques in \(C_4\)-free graphs of large minimum degree ⋮ On isomorphic linear partitions in cubic graphs ⋮ Fractional strong chromatic index of bipartite graphs ⋮ On incidence choosability of cubic graphs ⋮ On the strong chromatic index and maximum induced matching of tree-cographs, permutation graphs and chordal bipartite graphs ⋮ Strong Chromatic Index of 2-Degenerate Graphs ⋮ Unnamed Item ⋮ Induced Matchings in Graphs of Degree at Most 4 ⋮ Unnamed Item ⋮ Odd graph and its applications to the strong edge coloring ⋮ Injective edge-coloring of graphs with given maximum degree ⋮ The strong chromatic index of a class of graphs ⋮ Induced matchings in cubic graphs ⋮ Strong cliques and forbidden cycles ⋮ Strong edge-coloring for jellyfish graphs ⋮ (1,0)-Relaxed strong edge list coloring of planar graphs with girth 6 ⋮ 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 ⋮ The strong chromatic index of complete cubic Halin graphs ⋮ Induced Matchings in Graphs of Bounded Maximum Degree ⋮ Strong Chromatic Index of Sparse Graphs ⋮ Approximating maximum uniquely restricted matchings in bipartite graphs ⋮ Strong chromatic index of \(K_{1, t}\)-free graphs ⋮ Recent progress on strong edge-coloring of graphs ⋮ Edge-partition and star chromatic index ⋮ List star edge coloring of generalized Halin graphs ⋮ From light edges to strong edge-colouring of 1-planar graphs ⋮ Incidence and strong edge colorings of graphs ⋮ On the computational complexity of strong edge coloring ⋮ On a topological relaxation of a conjecture of Erdős and Nešetřil ⋮ Strong edge coloring of Cayley graphs and some product graphs
This page was built for publication:
