Funder
National Research, Development and Innovation, NKFIH
Subject
General Computer Science,Theoretical Computer Science
Reference33 articles.
1. Graph coloring and the immersion order;Abu-Khzam,2003
2. Finding disjoint paths in expanders deterministically and online;Alon,2007
3. Length 3 edge-disjoint paths is NP-hard;Alpert;Comput. Complexity,2012
4. Edge-coloring bipartite multigraphs in O(ElogD) time;Cole;Combinatorica,2001
5. Constructing graphs with no immersion of large complete graphs;Collins;J. Graph Theory,2014