| Research Title |
RELAXED LIST COLORING OF PLANAR GRAPHS WITHOUT 4-CYCLES AND 7-CYCLES |
| Date of Distribution |
18 June 2021 |
| Conference |
| Title of the Conference |
Annual pure and applied mathematics conference 2021 |
| Organiser |
Chulalongkorn University |
| Conference Place |
Chulalongkorn University |
| Province/State |
กรุงเทพมหานคร |
| Conference Date |
17 June 2021 |
| To |
18 June 2021 |
| Proceeding Paper |
| Volume |
2021 |
| Issue |
1 |
| Page |
145-152 |
| Editors/edition/publisher |
|
| Abstract |
A \emph{linear forest} is a forest in which each component is a path. A graph $G$ is called \emph{list-hyper-linear $3$-arborable} if for each $3$-assignment $L$ and for each $b\in \displaystyle\bigcup_{v\in V(G)}L(v)$, there exists $\phi$ such that $\phi(v)\in L(v)$ for every $v\in V(G)$ and the set of vertices with color $b$ is an independent set whereas other color classes are empty or induced linear forests. In this work, we prove that every planar graph without $4$-cycles and $7$-cycles is list-hyper-linear $3$-arborable. This implies every planar graph without $4$-cycles and $7$-cycles can be partitioned into three sets in which each of them induces a linear forest and one of them is an independent set. |
| Author |
|
| Peer Review Status |
มีผู้ประเมินอิสระ |
| Level of Conference |
ชาติ |
| Type of Proceeding |
Full paper |
| Type of Presentation |
Oral |
| Part of thesis |
true |
| Presentation awarding |
false |
| Attach file |
|
| Citation |
0
|
|
|
Publication
Journal Publication
ไทย