The following pages link to How to build a brick (Q2433703):
Displaying 20 items.
- Matching extension in prism graphs (Q512532) (← links)
- Nice pairs of disjoint pentagons in fullerene graphs (Q830887) (← links)
- Nice pairs of odd cycles in fullerene graphs (Q830896) (← links)
- Thin edges in braces (Q888627) (← links)
- A generalization of Little's theorem on Pfaffian orientations (Q1931399) (← links)
- Relations between global forcing number and maximum anti-forcing number of a graph (Q2078844) (← links)
- On essentially 4-edge-connected cubic bricks (Q2290348) (← links)
- \(b\)-invariant edges in essentially 4-edge-connected near-bipartite cubic bricks (Q2309225) (← links)
- Minimal bricks have many vertices of small degree (Q2441634) (← links)
- Minimal bricks (Q2496202) (← links)
- Generating bricks (Q2642014) (← links)
- <i>K</i> <sub>4</sub> -free and C6¯-free Planar Matching Covered Graphs (Q2811192) (← links)
- On Two Unsolved Problems Concerning Matching Covered Graphs (Q3174694) (← links)
- Disjoint Odd Cycles in Cubic Solid Bricks (Q4627479) (← links)
- The Cubic Vertices of Minimal Bricks (Q5418766) (← links)
- Minimally \(k\)-factor-critical graphs for some large \(k\) (Q6115428) (← links)
- A characterization of nonfeasible sets in matching covered graphs (Q6134642) (← links)
- Generating simple near‐bipartite bricks (Q6134648) (← links)
- The cubic vertices of solid minimal bricks (Q6184524) (← links)
- Minimum degree of minimal \((n-10)\)-factor-critical graphs (Q6197704) (← links)
