1986 search results - page 33 / 398 » Path Separability of Graphs |
DAM
2008
13 years 8 months ago
2008
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
HUMAN
2003
Springer
14 years 1 months ago
2003
Springer
Multipath on-demand routing protocols for mobile ad hoc networks try to reduce control overhead and end-to-end delay by computing multiple paths with a single route discovery proce...
DAM
2010
13 years 8 months ago
2010
We present an algorithm which given a source node and a set of n - 1 target nodes in the (n, k)-star graph Sn,k, where all nodes are distinct, builds a collection of n - 1 node-di...
ECCC
2008
13 years 8 months ago
2008
One way to quantify how dense a multidag is in long paths is to find the largest n, m such that whichever n edges are removed, there is still a path from an original input to an ...
JGT
2006
13 years 8 months ago
2006
An edge-colored graph H is properly colored if no two adjacent edges of H have the same color. In 1997, J. Bang-Jensen and G. Gutin conjectured that an edgecolored complete graph ...