共 50 条
- [31] A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3 Graphs and Combinatorics, 2016, 32 : 1055 - 1064
- [32] From light edges to strong edge-colouring of 1-planar graphs 1600, Discrete Mathematics and Theoretical Computer Science (22):
- [36] NoteOn a Problem of R. Häggkvist Concerning Edge-Colouring of Bipartite Graphs Combinatorica, 2004, 24 : 325 - 329
- [38] Minimum Cut of Directed Planar Graphs in O(n log log n) Time SODA'18: PROCEEDINGS OF THE TWENTY-NINTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2018, : 477 - 494
- [39] Edge-colouring pairs of binary trees: Towards a concise proof of the four-colour theorem of planar maps MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2002, 2002, 2420 : 25 - 39