Author:
Lai Hong-Jian,Lin Jianliang,Montgomery Bruce,Shui Taozhi,Fan Suohai
Subject
Discrete Mathematics and Combinatorics,Theoretical Computer Science
Reference9 articles.
1. K. Appel, W. Haken, Every planar map is four colorable, Part 1, Discharging, Illinois J. Math. 21 (1977) 429–490.
2. K. Appel, W. Haken, J. Kock, Every planar map is four colorable, Part 2, Reducibility, Illinois J. Math. 21 (1977) 491–567.
3. Graph Theory with Applications;Bondy,1981
4. On colouring the nodes of a network;Brooks;Proc. Cambridge Philos. Soc.,1941
5. Map colour theorem;Heawood;Quart. J. Pure Math.,1890
Cited by
48 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. On r-hued coloring of connected P5-free tripartite graphs;Applied Mathematics and Computation;2024-10
2. On $r$-Hued Coloring of Corona Product of Some Graphs;Missouri Journal of Mathematical Sciences;2024-05-01
3. The list r-hued coloring of Km,n;Discrete Applied Mathematics;2024-05
4. On r-dynamic k-coloring of ladder graph families;Discrete Mathematics, Algorithms and Applications;2024-04-30
5. Weak-Dynamic Coloring of Graphs Beyond-Planarity;Graphs and Combinatorics;2023-12-23