Uniquely restricted matchings in subcubic graphs without short cycles (Q6055410): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 users not shown)
Property / OpenAlex ID
 
Property / OpenAlex ID: W3094096913 / 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: Maximum matchings in regular graphs of high girth / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely restricted matchings in subcubic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lower bounds on the uniquely restricted matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniquely restricted matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new proof of the independence ratio of triangle-free cubic 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 matching number in a graph with given maximum degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence, odd girth, and average degree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Ramsey-Type Numbers and the Independence Ratio / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 01:53, 3 August 2024

scientific article; zbMATH DE number 7743911
Language Label Description Also known as
English
Uniquely restricted matchings in subcubic graphs without short cycles
scientific article; zbMATH DE number 7743911

    Statements

    Identifiers