Degree constrained subgraphs (Q2482112): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Vertex colouring edge partitions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-colouring edge-weightings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028414 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4362092 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4342632 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Harmonious Chromatic Number of Bounded Degree Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple existence criterion for \((g<f)\)-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge weights and vertex colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: The factorization of graphs. II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / 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: General antifactors of graphs / rank
 
Normal rank

Latest revision as of 21:33, 27 June 2024

scientific article
Language Label Description Also known as
English
Degree constrained subgraphs
scientific article

    Statements

    Degree constrained subgraphs (English)
    0 references
    0 references
    0 references
    0 references
    16 April 2008
    0 references
    0 references
    vertex colouring
    0 references
    edge weighting
    0 references
    degree constrained subgraphs
    0 references
    0 references