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

From MaRDI portal
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/s10878-011-9385-3 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2089322292 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic coloring of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclically 3-Colorable Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. I: Discharging / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar map is four colorable. II: Reducibility / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic Colourings of Planar Graphs with Large Girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5782525 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Cyclic Coloring Problem and Estimation of Sparse Hessian Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667621 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Layout of Graphs with Bounded Tree-Width / rank
 
Normal rank
Property / cites work
 
Property / cites work: Straight-Line Drawings on Restricted Integer Grids in Two and Three Dimensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4813178 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient Computation of Sparse Hessians Using Coloring and Automatic Differentiation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Laying Out Graphs Using Queues / rank
 
Normal rank
Property / cites work
 
Property / cites work: Comparing Queues and Stacks As Machines for Laying Out Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200238 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Note to the paper of Grünbaum on acyclic colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Every planar graph has an acyclic 8-coloring / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3576718 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4228512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Acyclic colorings of subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Recognition of Series Parallel Digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4667626 / rank
 
Normal rank

Latest revision as of 00:57, 6 July 2024

scientific article
Language Label Description Also known as
English
Acyclically 3-colorable planar graphs
scientific article

    Statements

    Acyclically 3-colorable planar graphs (English)
    0 references
    0 references
    0 references
    21 December 2012
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    planar graphs
    0 references
    acyclic coloring
    0 references
    cubic graphs
    0 references
    triconnectivity
    0 references
    0 references