On the orientable genus of graphs with bounded nonorientable genus (Q1379843): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q5724434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Computing the orientable genus of projective graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3757929 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the orientable genus of graphs embedded in the klein bottle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3972954 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The graph genus problem is NP-complete / rank
 
Normal rank

Latest revision as of 10:13, 28 May 2024

scientific article
Language Label Description Also known as
English
On the orientable genus of graphs with bounded nonorientable genus
scientific article

    Statements

    On the orientable genus of graphs with bounded nonorientable genus (English)
    0 references
    0 references
    25 February 1998
    0 references
    A conjecture of \textit{N. Robertson} and \textit{R. Thomas} [J. Graph Theory 15, No. 4, 407-419 (1991; Zbl 0735.05031)] on the orientable genus of graphs with a given nonorientable embedding is disproved.
    0 references
    orientable genus
    0 references
    embedding
    0 references
    0 references

    Identifiers