Checking the admissibility of odd-vertex pairings is hard (Q2142685): Difference between revisions

From MaRDI portal
Added link to MaRDI 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 / OpenAlex ID
 
Property / OpenAlex ID: W3133747404 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Recent results on well-balanced orientations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3085455 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Simultaneous well-balanced orientations of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Orientations, Connectivity and Odd-Vertex-Pairings in Finite Graphs / rank
 
Normal rank

Latest revision as of 03:45, 29 July 2024

scientific article
Language Label Description Also known as
English
Checking the admissibility of odd-vertex pairings is hard
scientific article

    Statements

    Checking the admissibility of odd-vertex pairings is hard (English)
    0 references
    0 references
    27 May 2022
    0 references
    0 references
    orientation
    0 references
    connectivity
    0 references
    0 references