Recent progress on strong edge-coloring of graphs
From MaRDI portal
Publication:5242836
Recommendations
Cites work
- scientific article; zbMATH DE number 4177085 (Why is no real title available?)
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- scientific article; zbMATH DE number 1420901 (Why is no real title available?)
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- A bound on the strong chromatic index of a graph
- A note on the strong chromatic index of bipartite graphs
- A stronger bound for the strong chromatic index (extended abstract)
- Clique number of the square of a line graph
- Colouring graphs with sparse neighbourhoods: bounds and applications
- Colouring squares of claw-free graphs
- Every planar graph with maximum degree 7 is of class 1
- Finding a maximum induced matching in weakly chordal graphs
- 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
- Fractional strong chromatic index of bipartite graphs
- Graph colouring and the probabilistic method
- Incidence and strong edge colorings of graphs
- Induced matchings
- Induced matchings in asteroidal triple-free graphs
- Induced matchings in cubic graphs
- Induced matchings in graphs of bounded maximum degree
- Induced matchings in graphs of degree at most 4
- Induced matchings in intersection graphs.
- Induced matchings in subcubic graphs
- Irredundancy in circular arc graphs
- List strong edge coloring of some classes of graphs
- Maximum induced matchings for chordal graphs in linear time
- NP-completeness of some generalizations of the maximum matching problem
- New results on induced matchings
- Odd graph and its applications to the strong edge coloring
- On a topological relaxation of a conjecture of Erdős and Nešetřil
- On incidence coloring and star arboricity of graphs
- On induced matchings
- On maximum induced matchings in bipartite graphs
- On strong edge-coloring of graphs with maximum degree 4
- On strong edge-colouring of subcubic graphs
- On strong list edge coloring of subcubic graphs
- On the approximability of the maximum induced matching problem
- On the clique number of the square of a line graph and its relation to maximum degree of the line graph
- On the computational complexity of strong edge coloring
- On the precise value of the strong chromatic index of a planar graph with a large girth
- On the strong chromatic index of sparse graphs
- Planar graphs of maximum degree seven are Class I
- Planar graphs with maximum degree 4 are strongly 19-edge-colorable
- Precise upper bound for the strong edge chromatic number of sparse planar graphs
- Squared chromatic number without claws or large cliques
- Strong chromatic index of 2-degenerate graphs
- Strong chromatic index of \(k\)-degenerate graphs
- Strong chromatic index of graphs with maximum degree four
- Strong chromatic index of planar graphs with large girth
- Strong chromatic index of subcubic planar multigraphs
- Strong edge coloring sparse graphs
- Strong edge colouring of subcubic graphs
- Strong edge-coloring for jellyfish graphs
- Strong edge-coloring for planar graphs with large girth
- Strong edge-coloring of \((3, \varDelta)\)-bipartite graphs
- Strong edge-coloring of graphs with maximum degree 4 using 22 colors
- Strong edge-coloring of planar graphs
- Strong edge-colorings for \(k\)-degenerate graphs
- Strong edge-colorings of sparse graphs with large maximum degree
- Strong edge-colouring of sparse planar graphs
- Strong list edge coloring of subcubic graphs
- Strong list-chromatic index of subcubic graphs
- The Strong Chromatic Index of Random Graphs
- The incidence coloring conjecture for graphs of maximum degree 3
- The induced matching and chain subgraph cover problems for convex bipartite graphs
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- The strong chromatic index of \((3,\Delta)\)-bipartite graphs
- The strong chromatic index of a class of graphs
- The strong chromatic index of a cubic graph is at most 10
- The strong chromatic index of sparse graphs
- The strong chromatic index ofC4-free graphs
Cited in
(12)- Strong edge-colorings of planar graphs with small girth
- On the computational complexity of strong edge coloring
- Some New Results on the Edge-Strength and Strength of Graphs
- On strong edge-coloring of graphs with maximum degree 5
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- Strongly proper connected coloring of graphs
- The strong chromatic index of graphs with edge weight eight
- The strong edge-coloring for graphs with small edge weight
- Revisiting semistrong edge‐coloring of graphs
- Strong edge-coloring of cubic bipartite graphs: a counterexample
- Semistrong edge colorings of planar graphs
- Strong edge-coloring of 2-degenerate graphs
This page was built for publication: Recent progress on strong edge-coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5242836)
