Abstract | ||
---|---|---|
Bricks are 3-connected bicritical graphs. Together with braces, they arise in matching theory as building blocks for matching covered graphs. |
Year | DOI | Venue |
---|---|---|
2013 | 10.1016/j.endm.2013.10.015 | Electronic Notes in Discrete Mathematics |
Keywords | Field | DocType |
Bricks,bicritical,matching,degree,minimal | Discrete mathematics,Graph,Combinatorics,Vertex (geometry),Brick,Conjecture,Mathematics | Journal |
Volume | ISSN | Citations |
44 | 1571-0653 | 0 |
PageRank | References | Authors |
0.34 | 4 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
henning bruhn | 1 | 177 | 24.93 |
maya stein | 2 | 81 | 15.65 |