Sciweavers

1321 search results - page 37 / 265
» Quadratic forms on graphs
Sort
View
104
Voted
DAM
2008
78views more  DAM 2008»
15 years 24 days ago
On classes of minimal circular-imperfect graphs
Circular-perfect graphs form a natural superclass of perfect graphs: on the one hand due to their definition by means of a more general coloring concept, on the other hand as an i...
Arnaud Pêcher, Annegret Wagler
104
Voted
DM
2007
101views more  DM 2007»
15 years 21 days ago
Threshold graphs, shifted complexes, and graphical complexes
We consider a variety of connections between threshold graphs, shifted complexes, and simplicial complexes naturally formed from a graph. These graphical complexes include the inde...
Caroline J. Klivans
DAM
1999
81views more  DAM 1999»
15 years 12 days ago
On the Extension of Bipartite to Parity Graphs
Parity graphs form a superclass of bipartite and distance-hereditary graphs. Since their introduction, all the algorithms proposed as solutions to the recognition problem and othe...
Serafino Cicerone, Gabriele Di Stefano
131
Voted
GD
2004
Springer
15 years 6 months ago
Algorithms for Drawing Media
We describe algorithms for drawing media, systems of states, tokens and actions that have state transition graphs in the form of partial cubes. Our algorithms are based on two prin...
David Eppstein
100
Voted
COMBINATORICA
2007
148views more  COMBINATORICA 2007»
15 years 22 days ago
Colored graphs without colorful cycles
A colored graph is a complete graph in which a color has been assigned to each edge, and a colorful cycle is a cycle in which each edge has a different color. We first show that ...
Richard N. Ball, Ales Pultr, Petr Vojtechovsk&yacu...