The complexity of two graph orientation problems (Q412352): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Importer (talk | contribs)
Changed an Item
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C38 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C83 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C85 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C12 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6030389 / rank
 
Normal rank
Property / zbMATH Keywords
 
graph orientation
Property / zbMATH Keywords: graph orientation / rank
 
Normal rank
Property / zbMATH Keywords
 
diameter
Property / zbMATH Keywords: diameter / rank
 
Normal rank
Property / zbMATH Keywords
 
planar graph
Property / zbMATH Keywords: planar graph / rank
 
Normal rank
Property / zbMATH Keywords
 
graph minors
Property / zbMATH Keywords: graph minors / rank
 
Normal rank
Property / zbMATH Keywords
 
apex graph
Property / zbMATH Keywords: apex graph / rank
 
Normal rank

Revision as of 18:51, 29 June 2023

scientific article
Language Label Description Also known as
English
The complexity of two graph orientation problems
scientific article

    Statements

    The complexity of two graph orientation problems (English)
    0 references
    0 references
    0 references
    4 May 2012
    0 references
    graph orientation
    0 references
    diameter
    0 references
    planar graph
    0 references
    graph minors
    0 references
    apex graph
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references