Minimal graphs for 2-factor extension (Q2185731): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q126426941, #quickstatements; #temporary_batch_1719359481675
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Generalization of matching extensions in graphs. III / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal graphs for matching extensions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending matchings in graphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Combinatorial optimization. Polyhedra and efficiency (3 volumes) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extensions to 2-factors in bipartite graphs / rank
 
Normal rank

Latest revision as of 20:34, 22 July 2024

scientific article
Language Label Description Also known as
English
Minimal graphs for 2-factor extension
scientific article

    Statements

    Minimal graphs for 2-factor extension (English)
    0 references
    0 references
    0 references
    0 references
    5 June 2020
    0 references
    2-factor
    0 references
    minimum expandable graph
    0 references
    reliability
    0 references

    Identifiers