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

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(6 intermediate revisions by 5 users not shown)
Property / author
 
Property / author: Maximilian Fürst / rank
Normal rank
 
Property / author
 
Property / author: Maximilian Fürst / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2963430299 / rank
 
Normal rank
Property / arXiv ID
 
Property / arXiv ID: 1710.10076 / rank
 
Normal rank
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
links / mardi / namelinks / mardi / name
 

Latest revision as of 20: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

    A lower bound on the acyclic matching number of subcubic graphs (English)
    0 references
    0 references
    0 references
    7 June 2018
    0 references
    0 references
    0 references
    0 references
    0 references
    acyclic matching
    0 references
    subcubic graph
    0 references
    0 references
    0 references