The following pages link to (Q3267903):
Displaying 16 items.
- Uniquely forced perfect matching and unique 3-edge-coloring (Q323081) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- Forcing matching numbers of fullerene graphs (Q968177) (← links)
- Ear-decompositions of matching-covered graphs (Q1052341) (← links)
- Brick decompositions and the matching rank of graphs (Q1055426) (← links)
- Matching theory -- a sampler: From Dénes König to the present (Q1198643) (← links)
- Odd factors of a graph (Q1313354) (← links)
- On unique \(k\)-factors and unique \([1,k]\)-factors in graphs. (Q1427474) (← links)
- Toughness and matching extension in graphs (Q1824634) (← links)
- Distance spectrum, 1-factor and vertex-disjoint cycles (Q2080240) (← links)
- Spectral radius and \([a,b]\)-factors in graphs (Q2138986) (← links)
- Clar structures vs Fries structures in hexagonal systems (Q2318231) (← links)
- Packing resonant hexagons in fullerenes (Q2339827) (← links)
- The factorization of graphs. II (Q5659592) (← links)
- On the structure of factorizable graphs (Q5659593) (← links)
- On the structure of factorizable graphs. II (Q5685115) (← links)
