Every<i>K</i><sub>1,7</sub>and<i>K</i><sub>1,3</sub>-free, 3-vertex critical graph of even order has a perfect matching (Q3008565)
From MaRDI portal
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Every<i>K</i><sub>1,7</sub>and<i>K</i><sub>1,3</sub>-free, 3-vertex critical graph of even order has a perfect matching |
scientific article |
Statements
Every<i>K</i><sub>1,7</sub>and<i>K</i><sub>1,3</sub>-free, 3-vertex critical graph of even order has a perfect matching (English)
0 references
22 June 2011
0 references
vertex-critical graph
0 references
perfect matching
0 references
