The following pages link to Generating bricks (Q2642014):
Displaying 22 items.
- Matching extension in prism graphs (Q512532) (← links)
- Thin edges in braces (Q888627) (← links)
- Minimally non-Pfaffian graphs (Q947729) (← links)
- Pfaffian labelings and signs of edge colorings (Q949785) (← links)
- Brick partitions of graphs (Q960924) (← links)
- Dissecting a brick into bars (Q964201) (← links)
- Structure of towers and a new proof of the tight cut lemma (Q1699784) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks (Q2309225) (← links)
- How to build a brick (Q2433703) (← links)
- Minimal bricks have many vertices of small degree (Q2441634) (← links)
- Minimal bricks (Q2496202) (← links)
- \(K_4\)-free and \(\overline{C_6}\)-free planar matching covered graphs (Q2811192) (← links)
- On Two Unsolved Problems Concerning Matching Covered Graphs (Q3174694) (← links)
- Generating near‐bipartite bricks (Q4632024) (← links)
- Euler Bricks (Q5048693) (← links)
- Birkhoff--von Neumann Graphs that are PM-Compact (Q5130578) (← links)
- The Cubic Vertices of Minimal Bricks (Q5418766) (← links)
- Minimal braces (Q6055406) (← links)
- On extremal nonsolid bricks (Q6055935) (← links)
- Generating simple near‐bipartite bricks (Q6134648) (← links)
- Excluding a planar matching minor in bipartite graphs (Q6144397) (← links)
