Recent progress on strong edge-coloring of graphs
From MaRDI portal
Publication:5242836
DOI10.1142/S1793830919500629zbMath1426.05040WikidataQ114978410 ScholiaQ114978410MaRDI QIDQ5242836
Xiangqian Zhou, Kecai Deng, Gexin Yu
Publication date: 7 November 2019
Published in: Discrete Mathematics, Algorithms and Applications (Search for Journal in Brave)
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Related Items
Strong edge-coloring of cubic bipartite graphs: a counterexample, Strong edge-colorings of planar graphs with small girth, The strong chromatic index of graphs with edge weight eight, Strong edge-coloring of 2-degenerate graphs, On strong edge-coloring of graphs with maximum degree 5
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Clique number of the square of a line graph
- A stronger bound for the strong chromatic index (extended abstract)
- Strong edge coloring sparse graphs
- On strong list edge coloring of subcubic graphs
- Strong list edge coloring of subcubic graphs
- Strong chromatic index of planar graphs with large girth
- Strong edge-colouring of sparse planar graphs
- The strong chromatic index of sparse graphs
- Strong edge-colorings for \(k\)-degenerate graphs
- Strong chromatic index of subcubic planar multigraphs
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs
- Fractional strong chromatic index of bipartite graphs
- Strong edge colouring of subcubic graphs
- Irredundancy in circular arc graphs
- On induced matchings
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- A note on the strong chromatic index of bipartite graphs
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- The strong chromatic index of a class of graphs
- Maximum induced matchings for chordal graphs in linear time
- NP-completeness of some generalizations of the maximum matching problem
- The strong chromatic index of a cubic graph is at most 10
- Induced matchings
- Incidence and strong edge colorings of graphs
- A bound on the strong chromatic index of a graph
- On incidence coloring and star arboricity of graphs
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in intersection graphs.
- On the computational complexity of strong edge coloring
- Strong edge-coloring for planar graphs with large girth
- On the strong chromatic index of sparse graphs
- 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
- On strong edge-coloring of graphs with maximum degree 4
- Colouring squares of claw-free graphs
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- Finding maximum induced matchings in subclasses of claw-free and \(P_5\)-free graphs, and in graphs with matching and induced matching of equal maximum size
- The incidence coloring conjecture for graphs of maximum degree 3
- On the approximability of the maximum induced matching problem
- Strong list-chromatic index of subcubic graphs
- Finding a maximum induced matching in weakly chordal graphs
- On maximum induced matchings in bipartite graphs
- Planar graphs of maximum degree seven are Class I
- New results on induced matchings
- Strong chromatic index of \(k\)-degenerate graphs
- Colouring graphs with sparse neighbourhoods: bounds and applications
- Odd graph and its applications to the strong edge coloring
- On a topological relaxation of a conjecture of Erdős and Nešetřil
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- On strong edge-colouring of subcubic graphs
- Strong edge-coloring for jellyfish graphs
- Induced Matchings in Graphs of Bounded Maximum Degree
- Squared Chromatic Number Without Claws or Large Cliques
- The strong chromatic index ofC4-free graphs
- List strong edge coloring of some classes of graphs
- Induced matchings in cubic graphs
- Strong Chromatic Index of 2-Degenerate Graphs
- Induced Matchings in Subcubic Graphs
- On the clique number of the square of a line graph and its relation to maximum degree of the line graph
- The Strong Chromatic Index of Random Graphs
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- Induced Matchings in Graphs of Degree at Most 4
- Strong edge-coloring of planar graphs
- Every planar graph with maximum degree 7 is of class 1
- Graph colouring and the probabilistic method
