Star coloring of graphs with girth at least five
From MaRDI portal
(Redirected from Publication:343773)
Recommendations
- On star 5-colorings of sparse graphs
- scientific article; zbMATH DE number 2044931
- scientific article; zbMATH DE number 7527896
- Star coloring of graphs
- Star coloring of certain graph classes
- Star 5-edge-colorings of subcubic multigraphs
- Star coloring high girth planar graphs
- Star colouring of bounded degree graphs and regular graphs
- Star edge coloring of some classes of graphs
- Star coloring under some graph operations
Cites work
- scientific article; zbMATH DE number 3632548 (Why is no real title available?)
- scientific article; zbMATH DE number 2209736 (Why is no real title available?)
- 6-Star-Coloring of Subcubic Graphs
- Acyclic Colourings of Planar Graphs with Large Girth
- Acyclic and star colorings of cographs
- Acyclic colorings of planar graphs
- Bounds on vertex colorings with restrictions on the union of color classes
- Coloring with no 2-colored \(P_4\)'s
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Star coloring and acyclic coloring of locally planar graphs
- Star coloring bipartite planar graphs
- Star coloring high girth planar graphs
- Star coloring of graphs
- Star coloring planar graphs from small lists
Cited in
(3)
This page was built for publication: Star coloring of graphs with girth at least five
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q343773)
