The following pages link to Star coloring of graphs (Q3159375):
Displaying 50 items.
- A polyhedral investigation of star colorings (Q284838) (← links)
- Star chromatic bounds (Q327688) (← links)
- Star coloring of graphs with girth at least five (Q343773) (← links)
- Star coloring of cubic graphs (Q402363) (← links)
- Improved bounds on coloring of graphs (Q412254) (← links)
- Vertex coloring without large polychromatic stars (Q432703) (← links)
- Restricted coloring problems on graphs with few \(P_4\)'s (Q490171) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- A survey and classification of Sierpiński-type graphs (Q516890) (← links)
- Nonrepetitive colouring via entropy compression (Q524188) (← links)
- Improved bounds for acyclic chromatic index of planar graphs (Q534360) (← links)
- Frugal, acyclic and star colourings of graphs (Q643020) (← links)
- Acyclic and star colorings of cographs (Q643025) (← links)
- Degenerate and star colorings of graphs on surfaces (Q661942) (← links)
- Characterisations and examples of graph classes with bounded expansion (Q661943) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Acyclic coloring of graphs without bichromatic long path (Q889416) (← links)
- Acyclic improper colourings of graphs with bounded maximum degree (Q960917) (← links)
- Acyclic and \(k\)-distance coloring of the grid (Q1014392) (← links)
- Graph coloring with cardinality constraints on the neighborhoods (Q1040081) (← links)
- Characterising bounded expansion by neighbourhood complexity (Q1621072) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Maximizing and minimizing the number of generalized colorings of trees (Q1727776) (← links)
- Graph 2-rankings (Q1733856) (← links)
- Anagram-free graph colouring (Q1753108) (← links)
- \(\mathcal Q\)-Ramsey classes of graphs (Q1761462) (← links)
- Coloring with no 2-colored \(P_4\)'s (Q1883636) (← links)
- Acyclic edge coloring of graphs with large girths (Q1934376) (← links)
- On star edge colorings of bipartite and subcubic graphs (Q2028078) (← links)
- Representing graphs as the intersection of cographs and threshold graphs (Q2040010) (← links)
- Coloring graphs without bichromatic cycles or paths (Q2045232) (← links)
- List star edge-coloring of claw-free subcubic multigraphs (Q2065794) (← links)
- Star colouring of bounded degree graphs and regular graphs (Q2124639) (← links)
- Intersection dimension and graph invariants (Q2214313) (← links)
- A polynomial time algorithm to find the star chromatic index of trees (Q2223458) (← links)
- Acyclic coloring of graphs and entropy compression method (Q2297725) (← links)
- Star coloring outerplanar bipartite graphs (Q2312070) (← links)
- Improved upper bound for the degenerate and star chromatic numbers of graphs (Q2410096) (← links)
- Acyclic edge-coloring using entropy compression (Q2444732) (← links)
- Acyclic edge coloring of planar graphs with girth at least 5 (Q2446889) (← links)
- Upward three-dimensional grid drawings of graphs (Q2503149) (← links)
- On star 5-colorings of sparse graphs (Q2656970) (← links)
- On star coloring of corona graphs (Q2794462) (← links)
- Star coloring of Cartesian product of paths and cycles. (Q2828893) (← links)
- Restricted coloring problems on graphs with few \(P'_4s\) (Q2840684) (← links)
- Star coloring of subcubic graphs (Q2860866) (← links)
- A survey of graph coloring - its types, methods and applications (Q2978431) (← links)
- Bounds on vertex colorings with restrictions on the union of color classes (Q3083409) (← links)
- (Q3167739) (← links)
- Two lower bounds for $p$-centered colorings (Q3386629) (← links)
