A Tutte-Type Characterization for Graph Factors (Q5267996): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / arXiv ID
 
Property / arXiv ID: 1512.05182 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3910557 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Factors and factorizations of graphs. Proof techniques in factor theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: On factors with all degrees odd / rank
 
Normal rank
Property / cites work
 
Property / cites work: General factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some results on odd factors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: \((1,f)\)-factors of graphs with odd property / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Cui-Kano's Characterization Problem on Graph Factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of graphs having all \((g,f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: General antifactors of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Good characterizations for some degree constrained subgraphs / rank
 
Normal rank

Latest revision as of 00:01, 14 July 2024

scientific article; zbMATH DE number 6730736
Language Label Description Also known as
English
A Tutte-Type Characterization for Graph Factors
scientific article; zbMATH DE number 6730736

    Statements

    A Tutte-Type Characterization for Graph Factors (English)
    0 references
    0 references
    0 references
    0 references
    14 June 2017
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    perfect matching
    0 references
    graph factor
    0 references
    degree prescribed subgraph problem
    0 references
    antifactor
    0 references
    0 references