215 search results - page 2 / 43 » On extremal k-outconnected graphs |
DM
1999
13 years 5 months ago
1999
We introduce some equivalence relations on graphs and posets and prove that they are closed under the cartesian product operation. These relations concern the edge-isoperimetric p...
ARSCOM
2007
13 years 5 months ago
2007
Let G be a simple graph and f : V (G) → {1, 3, 5, ...} an odd integer valued function defined on V (G). A spanning subgraph F of G is called a (1, f)odd factor if dF (v) ∈ {1...
DIAGRAMS
2008
Springer
13 years 7 months ago
2008
Springer
Research on effective algorithms for efficient graph layout continues apace, and faster technology has led to increasing research on algorithms for the depiction of dynamic graphs ...
COMBINATORICA
2006
13 years 5 months ago
2006
We introduce and discuss generalizations of the problem of independent transversals. Given a graph property R, we investigate whether any graph of maximum degree at most d with a ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
An identifying code of a graph G is a dominating set C such that every vertex x of G is distinguished from all other vertices by the set of vertices in C that are at distance at m...