Searching for a strong double tracing in a graph (Q1265251): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(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: The Directed Rural Postman Problem with Turn Penalties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Doubly eulerian trails on rectangular grids / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Efficient Implementation of Edmonds' Algorithm for Maximum Matching on Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An augmenting path algorithm for linear matroid parity / rank
 
Normal rank
Property / cites work
 
Property / cites work: A problem regarding the tracing of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bidirectional retracting-free double tracings and upper embeddability of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Traversing Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to determine the maximum genus of a graph / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/bf02564801 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1990323900 / rank
 
Normal rank

Latest revision as of 08:27, 30 July 2024

scientific article
Language Label Description Also known as
English
Searching for a strong double tracing in a graph
scientific article

    Statements

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references