Star coloring of certain graph classes
type: Item
instance of: scholarly article
title: Star coloring of certain graph classes
zbMATH Open document ID: 1382.05026
author: T. Karthick
published in: Graphs and Combinatorics
publication date: 2018-03-22T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C69
Mathematics Subject Classification ID: 05C75
zbMATH DE Number: 6852064
zbMATH Keywords: vertex coloring
zbMATH Keywords: star coloring
zbMATH Keywords: clique number
zbMATH Keywords: graph classes
MaRDI profile type: Publication
full work available at URL: s00373-017-1864-6
OpenAlex ID: W2773943138
cites work: Coloring with no 2-colored \(P_4\)'s
cites work: Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs
cites work: Graphs with no induced \(C_ 4\) and \(2K_ 2\)
cites work: Graph Classes: A Survey
cites work: On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
cites work: 6-Star-Coloring of Subcubic Graphs
cites work: Perfect coloring and linearly χ-boundP6-free graphs
cites work: Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
cites work: Q3025205
cites work: The Structure of Claw‐Free Perfect Graphs
cites work: The strong perfect graph theorem
cites work: On-line graph coloring of \({\mathbb{P}_5}\)-free graphs
cites work: Graph Theory and Probability. II
cites work: Q4448754
cites work: Star coloring of graphs
cites work: Q4193514
cites work: On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
cites work: Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
cites work: What Color Is Your Jacobian? Graph Coloring for Computing Derivatives
cites work: New Acyclic and Star Coloring Algorithms with Application to Computing Hessians
cites work: Trivially perfect graphs
cites work: Coloring the hypergraph of maximal cliques of a graph with no long path
cites work: Acyclic colorings of planar graphs
cites work: Q5749319
cites work: Effective on-line coloring of \(P_ 5\)-free graphs
cites work: Polynomial-time algorithms for minimum weighted colorings of \((P_5, \overline{P}_5)\)-free graphs and similar graph classes
cites work: Q4857375
cites work: Star chromatic bounds
cites work: Star coloring of subcubic graphs
cites work: Star Coloring and Acyclic Coloring of Locally Planar Graphs
cites work: Star coloring bipartite planar graphs
cites work: A characterization of perfect graphs
cites work: Acyclic and star colorings of cographs
cites work: Linear recognition of pseudo-split graphs
cites work: A description of claw-free perfect graphs
cites work: Degenerate and star colorings of graphs on surfaces
cites work: Q5692719
cites work: Vertex colouring and forbidden subgraphs -- a survey
cites work: Q4242948
cites work: On a property of the class of n-colorable graphs
cites work: Star coloring of graphs with girth at least five
cites work: Star coloring high girth planar graphs
cites work: Q4667626
DOI: 10.1007/S00373-017-1864-6
Recommended article: Q5076577
Recommended article: Star coloring of graphs
Recommended article: Q4448754
Recommended article: Star Edge Coloring of Some Classes of Graphs
Recommended article: Star coloring under some graph operations
Recommended article: Star coloring of sparse graphs
Recommended article: Star coloring of subcubic graphs
Recommended article: Star colouring of bounded degree graphs and regular graphs
Recommended article: Star chromatic numbers of graphs
Recommended article: Star chromatic number of some graphs
description: scientific article; zbMATH DE number 6852064