Matching and edge-connectivity in graphs with given maximum degree (Q2032857): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q3941433 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight bounds on maximal and maximum matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs from eigenvalues / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Lower Bounds for the Matching Number of Subcubic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independent sets and matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the subcubic graphs achieving equality in the Haxell‐Scott lower bound for the matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the size of a maximum matching in a regular graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Total Domination in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Tight lower bounds on the matching number in a graph with given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: A complete description of convex sets associated with matchings and edge‐connectivity in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5405504 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in a regular graph of specified connectivity and bounded order / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Edge-Connectivity, Eigenvalues, and Matchings in Regular Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching and edge-connectivity in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4871750 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A short proof of the Berge-Tutte formula and the Gallai-Edmonds structure theorem / rank
 
Normal rank

Latest revision as of 23:09, 25 July 2024

scientific article
Language Label Description Also known as
English
Matching and edge-connectivity in graphs with given maximum degree
scientific article

    Statements

    Matching and edge-connectivity in graphs with given maximum degree (English)
    0 references
    0 references
    0 references
    14 June 2021
    0 references
    matching number
    0 references
    maximum degree
    0 references
    edge-connectivity
    0 references

    Identifiers

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