65 search results - page 1 / 13 » A Characterization of Weakly Bipartite Graphs |
IPCO
1998
13 years 6 months ago
1998
We give a proof of Guenin's theorem characterizing weakly bipartite graphs by not having an odd-K5 minor. The proof curtails the technical and case-checking parts of Guenin�...
DAM
2006
13 years 4 months ago
2006
We prove that a triangle-free graph G is a tolerance graph if and only if there exists a set of consecutively ordered stars that partition the edges of G. Since tolerance graphs a...
DM
1999
13 years 4 months ago
1999
We characterize bipartite Steinhaus graphs in three ways by partitioning them into four classes and we describe the color sets for each of these classes. An interesting recursion ...
CORR
2010
Springer
13 years 4 months ago
2010
Springer
Whiteley [9] gives a complete characterization of the infinitesimal flexes of complete bipartite frameworks. Our work generalizes a specific infinitesimal flex to include joined gr...
EJC
1998
13 years 4 months ago
1998
A hierarchy of classes of graphs is proposed which includes hypercubes, acyclic cubical complexes, median graphs, almost median graphs, premedian graphs and partial cubes. Structu...