Sciweavers

540 search results - page 45 / 108
» New bounds on the edge number of a k-map graph
Sort
View
JCT
2007
133views more  JCT 2007»
13 years 8 months ago
Biased graphs. VII. Contrabalance and antivoltages
Abstract. We develop linear representation theory for bicircular matroids, a chief example being a matroid associated with forests of a graph, and bicircular lift matroids, a chief...
Thomas Zaslavsky
DM
2008
127views more  DM 2008»
13 years 9 months ago
An adjacency lemma for critical multigraphs
In edge colouring it is often useful to have information about the degree distribution of the neighbours of a given vertex. For example, the well known Vizing's Adjacency Lem...
David Cariolaro
CORR
2010
Springer
81views Education» more  CORR 2010»
13 years 9 months ago
Relaxation-based coarsening and multiscale graph organization
We propose a new measure that quantifies the "closeness" between two nodes in a given graph. The calculation of the measure is linear in the number of edges in the graph...
Dorit Ron, Ilya Safro, Achi Brandt
ISMB
2000
13 years 10 months ago
Search for a New Description of Protein Topology and Local Structure
A novel description of protein structure in terms of the generalized secondary structure elements (GSSE) is proposed. GSSE's are defined as fragments of the protein structure...
Lukasz Jaroszewski, Adam Godzik
JCO
2007
65views more  JCO 2007»
13 years 8 months ago
Group testing in graphs
This paper studies the group testing problem in graphs as follows. Given a graph G = (V, E), determine the minimum number t(G) such that t(G) tests are sufficient to identify an u...
Justie Su-tzu Juan, Gerard J. Chang