Timeline for Is there any relationships between path cover number and chromatic number?
Current License: CC BY-SA 4.0
9 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| May 1, 2022 at 18:57 | vote | accept | ZZP | ||
| Apr 1, 2022 at 11:10 | answer | added | kabenyuk | timeline score: 1 | |
| Apr 1, 2022 at 9:12 | comment | added | vidyarthi | @kabenyuk You have any insight as to why the inequality $\chi+\rho\le n+1$ is true? | |
| Apr 1, 2022 at 4:09 | history | edited | Martin Sleziak | CC BY-SA 4.0 |
added 1 character in body; edited tags
|
| Mar 28, 2022 at 7:32 | review | Close votes | |||
| Apr 12, 2022 at 3:02 | |||||
| Mar 28, 2022 at 7:21 | comment | added | kabenyuk | There is also this almost obvious inequality $\chi+\rho\leq n+1$ | |
| Mar 28, 2022 at 7:16 | comment | added | ZZP | Yes, the path has low chromatic number and path cover number. | |
| Mar 28, 2022 at 7:13 | comment | added | kabenyuk | For a simple path $P_3$ on three vertices we have: $n=3$, $\rho=1$, $\chi=2$. | |
| Mar 28, 2022 at 6:31 | history | asked | ZZP | CC BY-SA 4.0 |