Acyclically 3-colorable planar graphs
DOI10.1007/S10878-011-9385-3zbMATH Open1258.05025OpenAlexW2089322292MaRDI QIDQ695319FDOQ695319
Authors: Patrizio Angelini, Fabrizio Frati 
Publication date: 21 December 2012
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-011-9385-3
Recommendations
- Acyclically 3-colorable planar graphs
- Acyclic colorings of planar graphs
- Acyclic edge-coloring of planar graphs
- 3-hued coloring of planar graphs
- Cycle adjacency of planar graphs and 3-colourability
- Acyclic edge coloring of triangle-free planar graphs
- scientific article; zbMATH DE number 5584824
- A sufficient condition for planar graphs to be 3-colorable
- On 3-colorings of plane graphs
- Acyclic total colorings of planar graphs.
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Cites Work
- Note to the paper of Grünbaum on acyclic colorings
- Every planar map is four colorable. I: Discharging
- Every planar map is four colorable. II: Reducibility
- On acyclic colorings of planar graphs
- Negative results on acyclic improper colorings
- Acyclic Colourings of Planar Graphs with Large Girth
- Title not available (Why is that?)
- Acyclic colorings of planar graphs
- Acyclic coloring of graphs
- Efficient computation of sparse hessians using coloring and automatic differentiation
- The Recognition of Series Parallel Digraphs
- Title not available (Why is that?)
- Laying Out Graphs Using Queues
- Layout of Graphs with Bounded Tree-Width
- The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices
- Acyclic colorings of subcubic graphs
- Title not available (Why is that?)
- Every planar graph has an acyclic 8-coloring
- Title not available (Why is that?)
- Title not available (Why is that?)
- Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions
- Title not available (Why is that?)
- Comparing Queues and Stacks As Machines for Laying Out Graphs
- Acyclically 3-colorable planar graphs
Cited In (12)
- Planarization and acyclic colorings of subcubic claw-free graphs
- A note on the minimum number of choosability of planar graphs
- Acyclic coloring with few division vertices
- Minimum number of disjoint linear forests covering a planar graph
- Hardness transitions and uniqueness of acyclic colouring
- List edge and list total coloring of planar graphs with maximum degree 8
- Title not available (Why is that?)
- Cycle adjacency of planar graphs and 3-colourability
- Acyclically 3-colorable planar graphs
- An efficient case for computing minimum linear arboricity with small maximum degree
- Efficient algorithms for vertex arboricity of planar graphs
- Acyclic 3-coloring of generalized Petersen graphs
Uses Software
This page was built for publication: Acyclically 3-colorable planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q695319)
