Name
Abstract | ||
|---|---|---|
A subgraph of an edge-colored graph is said to be properly colored, or shortly PC, if any two adjacent edges have different colors. Fujita, Li, and Zhang gave a decomposition theorem for edge-colorings of complete bipartite graphs without PC C4. However, their decomposition just focuses on a local structure. In this paper, we give a new and global decomposition theorem for edge-colorings of complete bipartite graphs without PC C4. Our decomposition gives a corollary on the existence of a monochromatic star with almost sharp bound. |
Year | DOI | Venue |
|---|---|---|
2020 | 10.1002/jgt.22480 | JOURNAL OF GRAPH THEORY |
Keywords | Field | DocType |
complete bipartite graph,minimum color degree,properly colored cycle | Complete bipartite graph,Colored,Combinatorics,Mathematics | Journal |
Volume | Issue | ISSN |
93.0 | 2.0 | 0364-9024 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Roman Cada | 1 | 40 | 8.35 |
| Kenta Ozeki | 2 | 138 | 36.31 |
| Kiyoshi Yoshimoto | 3 | 133 | 22.65 |