Star coloring of graphs with girth at least five

DOI10.1007/s00373-016-1702-2zbMath1351.05089OpenAlexW2340476851MaRDI QIDQ343773

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

zbMATH Keywords

independence numberstar coloring

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items (2)

The complexity of restricted star colouring ⋮ Star coloring of certain graph classes

Cites Work

• Unnamed Item
• Unnamed Item
• Acyclic and star colorings of cographs
• Star coloring high girth planar graphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Coloring with no 2-colored \(P_4\)'s
• Bounds on vertex colorings with restrictions on the union of color classes
• Star Coloring and Acyclic Coloring of Locally Planar Graphs
• Star coloring of graphs
• New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
• Star coloring planar graphs from small lists
• Star coloring bipartite planar graphs
• Acyclic Colourings of Planar Graphs with Large Girth
• 6-Star-Coloring of Subcubic Graphs
• Acyclic colorings of planar graphs

This page was built for publication: Star coloring of graphs with girth at least five