Author:
Zhou Jinqiu, ,Li Qunfang,
Abstract
<abstract><p>A 3-connected graph is a <italic>brick</italic> if the graph obtained from it by deleting any two distinct vertices has a perfect matching. The importance of bricks stems from the fact that they are building blocks of the matching covered graphs. Lovász (Combinatorica, 3 (1983), 105-117) showed that every brick is $ K_4 $-based or $ \overline{C}_6 $-based. A brick is <italic>$ K_4 $-free</italic> (respectively, <italic>$ \overline{C}_6 $-free</italic>) if it is not $ K_4 $-based (respectively, $ \overline{C}_6 $-based). Recently, Carvalho, Lucchesi and Murty (SIAM Journal on Discrete Mathematics, 34(3) (2020), 1769-1790) characterised the PM-compact $ \overline{C}_6 $-free bricks. In this note, we show that, by using the brick generation procedure established by Norine and Thomas (J Combin Theory Ser B, 97 (2007), 769-817), the only PM-compact $ K_4 $-free brick is $ \overline{C}_6 $, up to multiple edges.</p></abstract>
Publisher
American Institute of Mathematical Sciences (AIMS)
Reference14 articles.
1. J. A. Bondy, U. S. R. Murty, Graph theory, Graduate Texts in Mathematics, Springer, New York, 2008.
2. M. H. de Carvalho, N. Kothari, X. Wang Y. Lin, Birkhoff-von neumann graphs that are pm-compact, SIAM J. Discrete Math., 34 (2020), 1769–1790. doi: 10.1137/18M1202347
3. M. H. de Carvalho, C. L. Lucchesi U. S. R. Murty, How to build a brick, Discrete Math., 306 (2006), 2383–2410. doi: 10.1016/j.disc.2005.12.032
4. M. H. de Carvalho, C. L. Lucchesi U. S. R. Murty, On tight cuts in matching covered graphs, J. Comb., 9 (2018), 163–184. doi: 10.4310/JOC.2018.v9.n1.a8
5. M. H. de Carvalho, C. L. Lucchesi U. S. R. Murty, Generating simple bricks and braces, Technical Report IC-08-16, Institute of Computing, University of Campinas, July 2008.