Sciweavers

1395 search results - page 56 / 279
» (k, )-Distance-Hereditary Graphs
Sort
View
CORR
2012
Springer
173views Education» more  CORR 2012»
13 years 5 months ago
A new approach to the orientation of random hypergraphs
A h-uniform hypergraph H = (V, E) is called ( , k)-orientable if there exists an assignment of each hyperedge e ∈ E to exactly of its vertices v ∈ e such that no vertex is ass...
Marc Lelarge
DM
2010
108views more  DM 2010»
14 years 9 months ago
Grundy number and products of graphs
The Grundy number of a graph G, denoted by (G), is the largest k such that G has a greedy k-colouring, that is a colouring with k colours obtained by applying the greedy algorithm...
Marie Asté, Frédéric Havet, C...
JCT
2006
72views more  JCT 2006»
14 years 9 months ago
Arboricity and tree-packing in locally finite graphs
Nash-Williams' arboricity theorem states that a finite graph is the edge-disjoint union of at most k forests if no set of vertices induces more than k( - 1) edges. We prove a...
Maya Jakobine Stein
FOCS
2009
IEEE
15 years 4 months ago
Higher Eigenvalues of Graphs
— We present a general method for proving upper bounds on the eigenvalues of the graph Laplacian. In particular, we show that for any positive integer k, the kth smallest eigenva...
Jonathan A. Kelner, James R. Lee, Gregory N. Price...
FAW
2009
Springer
178views Algorithms» more  FAW 2009»
15 years 4 months ago
Improved Algorithms for Detecting Negative Cost Cycles in Undirected Graphs
Xiaofeng Gu, Kamesh Madduri, K. Subramani, Hong-Ji...