Sciweavers

1163 search results - page 11 / 233
» Embedding into Bipartite Graphs
Sort
View
ECCC
2010
124views more  ECCC 2010»
13 years 2 months ago
A counterexample to the Alon-Saks-Seymour conjecture and related problems
Consider a graph obtained by taking an edge disjoint union of k complete bipartite graphs.
Hao Huang, Benny Sudakov
DAM
2008
123views more  DAM 2008»
13 years 8 months ago
Polar cographs
Polar graphs are a natural extension of some classes of graphs like bipartite graphs, split graphs and complements of bipartite graphs. A graph is (s, k)-polar if there exists a pa...
Tinaz Ekim, Nadimpalli V. R. Mahadev, Dominique de...
DM
2002
186views more  DM 2002»
13 years 7 months ago
Coloring Eulerian triangulations of the projective plane
A simple characterization of the 3, 4, or 5-colorable Eulerian triangulations of the projective plane is given. Key words: Projective plane, triangulation, coloring, Eulerian grap...
Bojan Mohar
ISAAC
2004
Springer
141views Algorithms» more  ISAAC 2004»
14 years 1 months ago
Weighted Coloring on Planar, Bipartite and Split Graphs: Complexity and Improved Approximation
We study complexity and approximation of min weighted node coloring in planar, bipartite and split graphs. We show that this problem is NP-complete in planar graphs, even if they a...
Jérôme Monnot, Vangelis Th. Paschos, ...
ARSCOM
2006
140views more  ARSCOM 2006»
13 years 8 months ago
Expansion Properties Of Levi Graphs
ABSTRACT. The Levi graph of a balanced incomplete block design is the bipartite graph whose vertices are the points and blocks of the design, with each block adjacent to those poin...
Dominic Lanphier, C. Miller, Jason Rosenhouse, A. ...