An orientation theorem with parity conditions (Q5954236): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new 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 / cites work
 
Property / cites work: Perfect matchings of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Odd Rooted Orientations and Upper-Embeddable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4386300 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4263712 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3682487 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Characterization in of Upper-Embeddable Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3896158 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Disjoint Spanning Trees of Finite Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new characterization of the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Survey of results on the maximum genus of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 21:35, 3 June 2024

scientific article; zbMATH DE number 1699125
Language Label Description Also known as
English
An orientation theorem with parity conditions
scientific article; zbMATH DE number 1699125

    Statements

    An orientation theorem with parity conditions (English)
    0 references
    0 references
    0 references
    0 references
    2001
    0 references
    genus
    0 references
    orientation
    0 references
    characterization
    0 references
    spanning arborescences
    0 references
    Nash-Williams' theorem
    0 references
    embeddable graphs
    0 references

    Identifiers