CCE&D: A Configuration Failure Prevention Method for Autonomous Driving Systems.
Proceedings of the Information Security and Privacy - 29th Australasian Conference, 2024
The minimum number of vertices for a triangle-free graph with chi<sub>l</sub>(G)=4 is 11.
Discret. Math., 2008
Disproof of a Conjecture on List Coloring.
Ars Comb., 2008
A note on the cover degeneracy of graphs.
J. Graph Theory, 2006
Extension of a list coloring problem.
Appl. Math. Lett., 2006
A note on 3-choosability of planar graphs without certain cycles.
Discret. Math., 2005
The transformation graph <i>G<sup>xyz</sup></i> when <i>xyz</i>=-++.
Discret. Math., 2005
Edge choosability of planar graphs without small cycles.
Discret. Math., 2004