Bounds on vertex colorings with restrictions on the union of color classes (Q3083409): Difference between revisions

@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1002/jgt.20501
@@ Property / full work available at URL: https://doi.org/10.1002/jgt.20501 / rank @@
+Normal rank
@@ Property / OpenAlex ID @@
+W2005409494
@@ Property / OpenAlex ID: W2005409494 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic coloring of graphs
@@ Property / cites work: Acyclic coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Bounds on Edge Colorings with Restrictions on the Union of Color Classes
+Normal rank
@@ Property / cites work @@
+Forbidden subgraph colorings and the oriented chromatic number
+Normal rank
@@ Property / cites work @@
+Excluding any graph as a minor allows a low tree-width 2-coloring
+Normal rank
@@ Property / cites work @@
+Star coloring of graphs
@@ Property / cites work: Star coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Radiocoloring in planar graphs: Complexity and approximations
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring a graph frugally
@@ Property / cites work: Colouring a graph frugally / rank @@
+Normal rank
@@ Property / cites work @@
+Discrete Mathematics
@@ Property / cites work: Discrete Mathematics / rank @@
+Normal rank
@@ Property / cites work @@
+Tree-depth, subgraph coloring and homomorphism bounds
+Normal rank
@@ Property / cites work @@
+Graph minors. II. Algorithmic aspects of tree-width
+Normal rank
@@ Property / cites work @@
+Graph minors. X: Obstructions to tree-decomposition
+Normal rank
@@ Property / cites work @@
+Graph searching and a min-max theorem for tree-width
+Normal rank
@@ Property / cites work @@
+Steiner trees, partial 2–trees, and minimum IFI networks
+Normal rank
@@ Property / cites work @@
+Colouring graphs with bounded generalized colouring number
+Normal rank