Star coloring of graphs with girth at least five
DOI10.1007/S00373-016-1702-2zbMATH Open1351.05089OpenAlexW2340476851MaRDI QIDQ343773FDOQ343773
Authors: M. A. Shalu, T. P. Sandhya 
Publication date: 29 November 2016
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-016-1702-2
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Acyclic Colourings of Planar Graphs with Large Girth
- Title not available (Why is that?)
- Acyclic colorings of planar graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Coloring with no 2-colored \(P_4\)'s
- Star coloring of graphs
- New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
- Acyclic and star colorings of cographs
- Star coloring high girth planar graphs
- Star coloring planar graphs from small lists
- Star coloring bipartite planar graphs
- Bounds on vertex colorings with restrictions on the union of color classes
- Star coloring and acyclic coloring of locally planar graphs
- 6-Star-Coloring of Subcubic Graphs
- Title not available (Why is that?)
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)
