Star coloring of graphs
From MaRDI portal
Recommendations
Cites work
Cited in
(88)- Acyclic and \(k\)-distance coloring of the grid
- Graph coloring with cardinality constraints on the neighborhoods
- Characterising bounded expansion by neighbourhood complexity
- Star coloring of certain graph classes
- Maximizing and minimizing the number of generalized colorings of trees
- Graph 2-rankings
- Anagram-free graph colouring
- \(\mathcal Q\)-Ramsey classes of graphs
- Coloring with no 2-colored \(P_4\)'s
- Acyclic edge coloring of graphs with large girths
- On star edge colorings of bipartite and subcubic graphs
- Representing graphs as the intersection of cographs and threshold graphs
- Coloring graphs without bichromatic cycles or paths
- List star edge-coloring of claw-free subcubic multigraphs
- Star colouring of bounded degree graphs and regular graphs
- Intersection dimension and graph invariants
- A polynomial time algorithm to find the star chromatic index of trees
- Acyclic coloring of graphs and entropy compression method
- Star coloring outerplanar bipartite graphs
- Improved upper bound for the degenerate and star chromatic numbers of graphs
- Acyclic edge-coloring using entropy compression
- Acyclic edge coloring of planar graphs with girth at least 5
- Upward three-dimensional grid drawings of graphs
- On star 5-colorings of sparse graphs
- On star coloring of corona graphs
- Star coloring of Cartesian product of paths and cycles.
- Restricted coloring problems on graphs with few P'_4s
- A polyhedral investigation of star colorings
- Star coloring of subcubic graphs
- A survey of graph coloring -- its types, methods and applications
- Bounds on vertex colorings with restrictions on the union of color classes
- scientific article; zbMATH DE number 6099774 (Why is no real title available?)
- Star chromatic bounds
- Two lower bounds for p-centered colorings
- Star coloring of graphs with girth at least five
- A Conjecture of Borodin and a Coloring of Grünbaum
- Colourings of the Cartesian Product of Graphs and Multiplicative Sidon Sets
- Star coloring bipartite planar graphs
- Star coloring of sparse graphs
- Star coloring of cubic graphs
- Improved bounds on coloring of graphs
- Vertex coloring without large polychromatic stars
- scientific article; zbMATH DE number 2044931 (Why is no real title available?)
- Restricted coloring problems on graphs with few P₄'s
- 6-Star-Coloring of Subcubic Graphs
- Star Chromatic Index
- Star edge coloring of the Cartesian product of graphs
- ON STAR COLORING OF DEGREE SPLITTING OF COMB PRODUCT GRAPHS
- Star chromatic number of some graphs
- An introduction to the discharging method via graph coloring
- On star coloring of modular product of graphs
- A generic framework for approximation analysis of greedy algorithms for star bicoloring
- A general framework for hypergraph coloring
- On star coloring of degree splitting of join graphs
- Improved bounds for centered colorings
- A survey and classification of Sierpiński-type graphs
- Nonrepetitive colouring via entropy compression
- A local lemma for focused stochastic algorithms
- Star coloring and tree-width of the Kneser graph \(\mathrm{KG}(n, 2)\)
- Coloring parameters for graphs on surfaces
- Improved bounds for acyclic chromatic index of planar graphs
- The Star and Biclique Coloring and Choosability Problems
- Star coloring under some graph operations
- scientific article; zbMATH DE number 7651161 (Why is no real title available?)
- Block colourings of star systems
- Acyclic chromatic index of chordless graphs
- Star chromatic number of some graph products
- Graph colorings with restricted bicolored subgraphs: I. Acyclic, star, and treewidth colorings
- The complexity of star colouring in bounded degree graphs and regular graphs
- Injective edge-coloring of subcubic graphs
- One-dependent colorings of the star graph
- Upper bounds on the acyclic chromatic index of degenerate graphs
- Frugal, acyclic and star colourings of graphs
- Acyclic and star colorings of cographs
- Coloring of graphs avoiding bicolored paths of a fixed length
- Degenerate and star colorings of graphs on surfaces
- Characterisations and examples of graph classes with bounded expansion
- Proper conflict-free coloring of graphs with large maximum degree
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs
- Star coloring of some toroidal graphs
- Hardness transitions of star colouring and restricted star colouring
- Star colouring and locally constrained graph homomorphisms
- Acyclic, star and injective colouring: a complexity picture for H-free graphs
- Injective edge colorings of degenerate graphs and the oriented chromatic number
- -boundedness and related problems on graphs without long induced paths: a survey
- Acyclic edge coloring of 3-sparse graphs
- Acyclic coloring of graphs without bichromatic long path
- Acyclic improper colourings of graphs with bounded maximum degree
This page was built for publication: Star coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3159375)
