共 50 条
- [34] List Homomorphisms by Deleting Edges and Vertices: Tight Complexity Bounds for Bounded-Treewidth Graphs Leibniz International Proceedings in Informatics, LIPIcs, 308
- [35] PROPER TOTAL COLORING DISTINGUISHING ADJACENT VERTICES BY SUMS OF SOME PRODUCT GRAPHS COMMUNICATIONS OF THE KOREAN MATHEMATICAL SOCIETY, 2015, 30 (01): : 45 - 64
- [36] A General Technique for Fast Comprehensive Multi-Root Planning on Graphs by Coloring Vertices and Deferring Edges 2015 IEEE INTERNATIONAL CONFERENCE ON ROBOTICS AND AUTOMATION (ICRA), 2015, : 5433 - 5440
- [39] Coloring Vertices and Faces of Locally Planar Graphs Graphs and Combinatorics, 2006, 22 : 289 - 295