Searching for a strong double tracing in a graph (Q1265251): Difference between revisions
From MaRDI portal
Set profile property. |
ReferenceBot (talk | contribs) Changed an Item |
||
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 |
Latest revision as of 16:15, 28 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Searching for a strong double tracing in a graph |
scientific article |
Statements
Searching for a strong double tracing in a graph (English)
0 references
28 September 1998
0 references
\(U\)-turn
0 references
strong double tracing
0 references
Eulerian graph
0 references
connected graph
0 references