<i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs (Q2811192): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Matching covered graphs and subdivisions of \(K_ 4\) and \(\bar C_ 6\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to build a brick / 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: Ear-decompositions of matching-covered 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: Generating bricks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Totally odd \(K_4\)-subdivisions in 4-chromatic graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 2-Isomorphic Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of Toft's conjecture: Every graph containing no fully odd \(K_4\) is 3-colorable / rank
 
Normal rank

Revision as of 02:55, 12 July 2024

scientific article
Language Label Description Also known as
English
<i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs
scientific article

    Statements

    <i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs (English)
    0 references
    0 references
    0 references
    10 June 2016
    0 references
    matching covered graphs
    0 references
    bricks
    0 references
    ear-decompositions
    0 references
    bi-subdivision
    0 references
    conformal subgraphs
    0 references

    Identifiers