A bound on the total size of a cut cover (Q2484376): 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: Graphs with the Circuit Cover Property / rank
 
Normal rank
Property / cites work
 
Property / cites work: Shortest coverings of graphs with cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Decomposition of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Representation of a Graph by Set Intersections / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Graphs by Cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4344209 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proofs of two minimum circuit cover conjectures / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cycle covering in bridgeless graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering a graph with cuts of minimum total size / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a problem of G. O. H. Katona and T. Tarján / rank
 
Normal rank
Property / cites work
 
Property / cites work: Covering Graphs by Simple Circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4166786 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On shortest cocycle covers of 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: Proof of a conjecture of Katona and Tarjan / rank
 
Normal rank
Property / cites work
 
Property / cites work: On embedding complete graphs into hypercubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4242950 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3137210 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3916595 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polyhedral decompositions of cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Complexity of Finding a Minimum Cycle Cover of a Graph / rank
 
Normal rank

Revision as of 12:42, 10 June 2024

scientific article
Language Label Description Also known as
English
A bound on the total size of a cut cover
scientific article

    Statements

    A bound on the total size of a cut cover (English)
    0 references
    0 references
    0 references
    1 August 2005
    0 references
    Cycle
    0 references
    Edge cover
    0 references

    Identifiers