Bicritical graphs without removable edges (Q2166208): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2022.04.026 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4281661185 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ear decompositions of matching covered graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a conjecture of Lovász concerning bricks. I: The characteristic of a matching covered graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Brick decompositions and the matching rank of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching structure and the matching lattice / rank
 
Normal rank
Property / cites work
 
Property / cites work: On a Family of Planar Bicritical Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Matching theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: Minimal bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Factorization of Linear Graphs / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:25, 29 July 2024

scientific article
Language Label Description Also known as
English
Bicritical graphs without removable edges
scientific article

    Statements

    Bicritical graphs without removable edges (English)
    0 references
    0 references
    0 references
    0 references
    24 August 2022
    0 references
    bicritical graph
    0 references
    removable edge
    0 references
    2-vertex cut
    0 references
    claw-free graph
    0 references

    Identifiers