A lower bound on the acyclic matching number of subcubic graphs (Q1637156): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Degenerate matchings and edge colorings / 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 graphs of odd regularity and girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum matchings in regular graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized subgraph-restricted matchings in 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: Induced matchings in subcubic graphs without short cycles / 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: Induced matchings in cubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Graphs of Bounded Maximum Degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Induced Matchings in Subcubic 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: Q3318125 / rank
 
Normal rank

Latest revision as of 19:54, 15 July 2024

scientific article
Language Label Description Also known as
English
A lower bound on the acyclic matching number of subcubic graphs
scientific article

    Statements

    Identifiers

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