Graphs with the Circuit Cover Property (Q4305925): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Covering Multigraphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle covers of cubic multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Face colorings of embedded graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest coverings of graphs with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Double cycle covers and the petersen graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: An integer analogue of Carathéodory's theorem / 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: Q3222878 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering weighted graphs by even subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer flows and cycle covers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulersche Linien und Kreisüberdeckungen, die vorgegebene Durchgänge in den Kanten vermeiden / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuit decomposition of planar Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3292914 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids with the circuit cover property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Blocking and anti-blocking pairs of polyhedra / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle double covers of graphs with Hamilton paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3734435 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Loops in Duals / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166786 / 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: Flows and generalized coloring theorems in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short cycle covers and the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: Short circuit covers for regular matroids with a nowhere zero 5-flow / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3048571 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4200232 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the eulericity of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3818127 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matroids and multicommodity flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even circuits in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph minors. XIII: The disjoint paths problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nowhere zero flow and circuit covering in regular matroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Semi-duality and the cycle double cover conjecture / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Imbedding of Linear Graphs in Surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4111952 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integer flows / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3831050 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimum cycle coverings and integer flows / rank
 
Normal rank

Latest revision as of 17:52, 22 May 2024

scientific article; zbMATH DE number 639595
Language Label Description Also known as
English
Graphs with the Circuit Cover Property
scientific article; zbMATH DE number 639595

    Statements

    0 references
    0 references
    0 references
    15 September 1994
    0 references
    circuit cover
    0 references
    edge-weighted graph
    0 references
    multiset
    0 references
    edge-cut
    0 references
    circuit cover property
    0 references
    Petersen's graph
    0 references
    cycle double cover
    0 references
    Graphs with the Circuit Cover Property (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

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