Matching, Euler tours and the Chinese postman (Q4766817): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Q5808057 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Networks and vehicle routing for municipal waste collection / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3277097 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matching and a polyhedron with 0,1-vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the surface duality of linear graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5675543 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3274170 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Revised Matrix Algorithms for Shortest Paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4085470 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank

Revision as of 14:33, 12 June 2024

scientific article; zbMATH DE number 3441870
Language Label Description Also known as
English
Matching, Euler tours and the Chinese postman
scientific article; zbMATH DE number 3441870

    Statements

    Matching, Euler tours and the Chinese postman (English)
    0 references
    0 references
    0 references
    1973
    0 references

    Identifiers