Acyclic coloring with few division vertices (Q396683): Difference between revisions

@@ Property / cites work @@
+Every planar graph has an acyclic 7-coloring
@@ Property / cites work: Every planar graph has an acyclic 7-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic coloring of graphs
@@ Property / cites work: Acyclic coloring of graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclically 3-colorable planar graphs
@@ Property / cites work: Acyclically 3-colorable planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs. (Reprint)
@@ Property / cites work: On acyclic colorings of planar graphs. (Reprint) / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic 5-choosability of planar graphs without adjacent short cycles
+Normal rank
@@ Property / cites work @@
+Q4180377
@@ Property / cites work: Q4180377 / rank @@
+Normal rank
@@ Property / cites work @@
+The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
+Normal rank
@@ Property / cites work @@
+Uniqueness of colorability and colorability of planar 4-regular graphs are NP-complete
+Normal rank
@@ Property / cites work @@
+How to draw a planar graph on a grid
@@ Property / cites work: How to draw a planar graph on a grid / rank @@
+Normal rank
@@ Property / cites work @@
+Layout of Graphs with Bounded Tree-Width
@@ Property / cites work: Layout of Graphs with Bounded Tree-Width / rank @@
+Normal rank
@@ Property / cites work @@
+Q4657578
@@ Property / cites work: Q4657578 / rank @@
+Normal rank
@@ Property / cites work @@
+Minimum feedback vertex set and acyclic coloring.
@@ Property / cites work: Minimum feedback vertex set and acyclic coloring. / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with maximum degree \(6\) are acyclically \(11\)-colorable
+Normal rank
@@ Property / cites work @@
+Q4200238
@@ Property / cites work: Q4200238 / rank @@
+Normal rank
@@ Property / cites work @@
+Graphs with maximum degree 5 are acyclically 7-colorable
+Normal rank
@@ Property / cites work @@
+Every planar graph has an acyclic 8-coloring
@@ Property / cites work: Every planar graph has an acyclic 8-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic Coloring with Few Division Vertices
@@ Property / cites work: Acyclic Coloring with Few Division Vertices / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic Colorings of Graph Subdivisions
@@ Property / cites work: Acyclic Colorings of Graph Subdivisions / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of graph subdivisions revisited
@@ Property / cites work: Acyclic colorings of graph subdivisions revisited / rank @@
+Normal rank
@@ Property / cites work @@
+Q3576718
@@ Property / cites work: Q3576718 / rank @@
+Normal rank
@@ Property / cites work @@
+Q3138887
@@ Property / cites work: Q3138887 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of subcubic graphs
@@ Property / cites work: Acyclic colorings of subcubic graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4667626
@@ Property / cites work: Q4667626 / rank @@
+Normal rank
@@ Property / cites work @@
+Canonical ordering trees and their applications in graph drawing
+Normal rank