Covering a graph with cycles. (Q1406651): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4166786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Clustering for the Design of SONET Rings in Interoffice Telecommunications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519709 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching, Euler tours and the Chinese postman / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Graphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest coverings of graphs with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle covering in bridgeless graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest Circuit Covers and Postman Tours in Graphs with a Nowhere Zero 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Graphs by Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 2 / rank
 
Normal rank

Latest revision as of 09:38, 6 June 2024

scientific article
Language Label Description Also known as
English
Covering a graph with cycles.
scientific article

    Statements

    Covering a graph with cycles. (English)
    0 references
    0 references
    0 references
    0 references
    7 September 2003
    0 references
    Graph theory
    0 references
    Heuristic methods
    0 references
    Problem solving
    0 references
    Computational methods
    0 references
    Cycle cover problems (CCP)
    0 references

    Identifiers

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