Timeline for Concepts of criticality in graph theory
Current License: CC BY-SA 3.0
6 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 30, 2017 at 19:00 | vote | accept | Dominic van der Zypen | ||
| May 30, 2017 at 7:05 | answer | added | user1272680 | timeline score: 4 | |
| May 29, 2017 at 19:31 | review | Close votes | |||
| May 30, 2017 at 0:22 | |||||
| May 29, 2017 at 17:52 | comment | added | Peter Heinig | Taken literally, the answer to question 1) is no in view of an extremely small counterexample: the non-connected graph $\bullet\quad\bullet$ - $\bullet$ has $\chi=2$, is not vertex-critical (delete $\bullet$) but is edge-critical because deleting the edge makes $\chi$ drop from $2$ to $1$, and there is only this edge. | |
| May 29, 2017 at 15:11 | answer | added | Abdelmalek Abdesselam | timeline score: 2 | |
| May 29, 2017 at 14:53 | history | asked | Dominic van der Zypen | CC BY-SA 3.0 |