65 search results - page 1 / 13 » Finding maximum degrees in hidden bipartite graphs |
SIGMOD
2010
ACM
14 years 3 months ago
2010
ACM
DM
2010
13 years 11 months ago
2010
For graphs of bounded maximum degree, we consider acyclic t-improper colourings, that is, colourings in which each bipartite subgraph consisting of the edges between two colour cl...
COCOON
2010
Springer
14 years 3 months ago
2010
Springer
ESA
2008
Springer
14 years 20 days ago
2008
Springer
We consider two generalizations of the edge coloring problem in bipartite graphs. The first problem we consider is the weighted bipartite edge coloring problem where we are given a...
ORL
2007
13 years 10 months ago
2007
We prove that it is NP-complete to decide whether a bipartite graph of maximum degree three on nk vertices can be partitioned into n paths of length k. Finally, we propose some ap...