Ear-decompositions of matching-covered graphs (Q1052341): 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 / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Regularisable graphs I / rank
 
Normal rank
Property / cites work
 
Property / cites work: Independence numbers of graphs - an extension of the Koenig-Egervary theorem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Paths, Trees, and Flowers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3284375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5508779 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Theorem on <i>k</i>-Saturated Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Simplified Form for Nearly Reducible and Nearly Decomposable Matrices / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3267903 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theorem on connected graphs in which every edge belongs to a 1-factor / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the structure of factorizable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On minimal elementary bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank of maximum matchings in a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matchings in regular graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On n-extendable graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A characterization of the graphs in which the transversal number equals the matching number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The 1-Factors of Oriented Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 08:39, 14 June 2024

scientific article
Language Label Description Also known as
English
Ear-decompositions of matching-covered graphs
scientific article

    Statements

    Ear-decompositions of matching-covered graphs (English)
    0 references
    0 references
    1983
    0 references
    matching
    0 references
    matching-covered
    0 references
    ear-decomposition
    0 references
    Koenig property
    0 references
    matching- covered subgraphs
    0 references
    cyclomatic numbers
    0 references

    Identifiers