An upper bound of linear chromatic number of planar graphs
From MaRDI portal
Recommendations
- Upper bounds on the linear chromatic number of a graph
- An upper bound for the chromatic number of line graphs
- An upper bound for the chromatic number of line graphs
- New upper bounds on linear coloring of planar graphs
- Upper bounds of entire chromatic number of plane graphs
- A bound on the chromatic number of an almost planar graph
- A result on linear coloring of planar graphs
- A bound on the chromatic number of the square of a planar graph
- Improved bounds on linear coloring of plane graphs
- A new upper bound for the chromatic number of a graph
Cited in
(14)- Upper bounds of entire chromatic number of plane graphs
- The \(k\)th upper chromatic number of the line
- Linear coloring of graphs
- Upper bound on the circular chromatic number of the plane
- New upper bounds on linear coloring of planar graphs
- New upper bound on the chromatic number of the square of a planar graph
- Linear coloring of planar graphs without 3-cycles
- Linear coloring of planar graphs without 4-cycles
- A result on linear coloring of planar graphs
- Plane graphs with maximum degree 6 are 13-linear-colorable
- Plane graphs with maximum degree 5 are 11-linear-colorable
- Improved bounds on linear coloring of plane graphs
- Upper bounds on the linear chromatic number of a graph
- A bound on the chromatic number of an almost planar graph
This page was built for publication: An upper bound of linear chromatic number of planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2916456)
