How to build a brick (Q2433703)

From MaRDI portal
scientific article
Language Label Description Also known as
English
How to build a brick
scientific article

    Statements

    How to build a brick (English)
    0 references
    30 October 2006
    0 references
    A graph is said to be matching covered if it is connected, has at least two vertices and each of its edges is contained in a perfect matching. A 3-connected graph \(G\) is called a brick if, for any two vertices \(u\) and \(v\) of \(G\), the graph obtained from \(G\) after removing the vertices \(u\) and \(v\) has a perfect matching. The purpose of this paper is to present a recursive procedure for generating bricks. It is shown that all bricks may be generated from three basic bricks by means of four simple operations, so that every brick different from the three basic bricks has an edge called thin edge, and that every simple planar solid brick is an odd wheel, where a brick is solid if it does not have any nontrivial separating cuts.
    0 references
    0 references
    matching covered graph
    0 references
    brick generation
    0 references
    thin edge
    0 references
    solid edge
    0 references

    Identifiers