Strong incidence coloring of outerplanar graphs
From MaRDI portal
Recommendations
Cites work
- A stronger bound for the strong chromatic index (extended abstract)
- Further results on strong edge-colourings in outerplanar graphs
- Graph theory
- scientific article; zbMATH DE number 3851125 (Why is no real title available?)
- scientific article; zbMATH DE number 4187830 (Why is no real title available?)
- Incidence and strong edge colorings of graphs
- Incidence coloring of k-degenerated graphs
- Note on incidence chromatic number of subquartic graphs
- On incidence coloring conjecture in Cartesian products of graphs
- Problems and results in combinatorial analysis and graph theory
- Some results on the incidence coloring number of a graph
- Strong edge-coloring of planar graphs
- Strong edge-colouring and induced matchings
- Strong edge-colouring of sparse planar graphs
- The incidence chromatic number of toroidal grids
- The incidence coloring conjecture for graphs of maximum degree 3
- The incidence coloring number of Halin graphs and outerplanar graphs
- The strong chromatic index of a cubic graph is at most 10
Cited in
(9)- Incidence and strong edge colorings of graphs
- The incidence coloring number of Halin graphs and outerplanar graphs
- Incidence coloring -- cold cases
- A note on incidence graphs
- scientific article; zbMATH DE number 2140697 (Why is no real title available?)
- Simultaneous coloring of vertices and incidences of outerplanar graphs
- Incidence coloring of outer-1-planar graphs
- Conflict-free incidence coloring of outer-1-planar graphs
- On strong incidence coloring of subcubic graphs
This page was built for publication: Strong incidence coloring of outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6110619)