On the complexity of circulations
Journal of Algorithms
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
Circuit Covers in Series-Parallel Mixed Graphs
LATIN '98 Proceedings of the Third Latin American Symposium on Theoretical Informatics
Complexity of cycle and path problems in graphs
Complexity of cycle and path problems in graphs
Graph Theory With Applications
Graph Theory With Applications
Minimum cycle cover and Chinese postman problems on mixed graphs with bounded tree-width
Discrete Applied Mathematics
| Hi-index | 0.00 |
It is shown that the maximum possible chromatic number of the square of a graph with maximum degree d and girth g is (1 +o(1))d2 if g = 3, 4, 5 or 6, and is Θ(d2 / log d) ...