Acyclically 3-colorable planar graphs (Q695319): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/s10878-011-9385-3
+Normal rank
@@ Property / OpenAlex ID @@
+W2089322292
@@ Property / OpenAlex ID: W2089322292 / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic colorings of planar graphs
@@ Property / cites work: Acyclic colorings of planar graphs / 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 @@
+Every planar map is four colorable. I: Discharging
+Normal rank
@@ Property / cites work @@
+Every planar map is four colorable. II: Reducibility
+Normal rank
@@ Property / cites work @@
+On acyclic colorings of planar graphs
@@ Property / cites work: On acyclic colorings of planar graphs / rank @@
+Normal rank
@@ Property / cites work @@
+Acyclic Colourings of Planar Graphs with Large Girth
+Normal rank
@@ Property / cites work @@
+Q5782525
@@ Property / cites work: Q5782525 / rank @@
+Normal rank
@@ Property / cites work @@
+The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
+Normal rank
@@ Property / cites work @@
+Q4667621
@@ Property / cites work: Q4667621 / 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 @@
+Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
+Normal rank
@@ Property / cites work @@
+Q4813178
@@ Property / cites work: Q4813178 / rank @@
+Normal rank
@@ Property / cites work @@
+Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation
+Normal rank
@@ Property / cites work @@
+Laying Out Graphs Using Queues
@@ Property / cites work: Laying Out Graphs Using Queues / rank @@
+Normal rank
@@ Property / cites work @@
+Comparing Queues and Stacks As Machines for Laying Out Graphs
+Normal rank
@@ Property / cites work @@
+Q4200238
@@ Property / cites work: Q4200238 / rank @@
+Normal rank
@@ Property / cites work @@
+Note to the paper of Grünbaum on acyclic colorings
+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 @@
+Q3576718
@@ Property / cites work: Q3576718 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4228512
@@ Property / cites work: Q4228512 / 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 @@
+The Recognition of Series Parallel Digraphs
@@ Property / cites work: The Recognition of Series Parallel Digraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Q4667626
@@ Property / cites work: Q4667626 / rank @@
+Normal rank