Name
Abstract | ||
|---|---|---|
A graph is near-bipartite if its vertex set can be partitioned into an independent set and a set that induces a forest. It is clear that near-bipartite graphs are 3-colorable. In this note, we show that planar graphs without cycles of lengths in {4,6,8} are near-bipartite. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1016/j.dam.2020.04.017 | Discrete Applied Mathematics |
Keywords | DocType | Volume |
Planar graphs,Near-bipartite,3-colorable | Journal | 284 |
ISSN | Citations | PageRank |
0166-218X | 0 | 0.34 |
References | Authors | |
0 | 2 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Runrun Liu | 1 | 8 | 5.29 |
| Gexin Yu | 2 | 340 | 40.11 |