496 search results - page 38 / 100 » C4-saturated bipartite graphs |
171
click to vote
ACTA
2008
15 years 6 months ago
2008
We study the two-dimensional version of the bin packing problem with conflicts. We are given a set of (two-dimensional) squares V = {1, 2, . . . , n} with sides s1, s2 . . . , sn ...
165
click to vote
WG
2010
Springer
15 years 4 months ago
2010
Springer
The problem of determining the cutwidth of a graph is a notoriously hard problem which remains NP-complete under severe restrictions on input graphs. Until recently, non-trivial p...
212
click to vote
ISAAC
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we deal with both the complexity and the approximability of the labeled perfect matching problem in bipartite graphs. Given a simple graph G = (V, E) with n vertices...
161
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
133
click to vote
DM
2010
15 years 6 months ago
2010
In this paper, we show that the dimension of the adjacency poset of a planar graph is at most 8. From below, we show that there is a planar graph whose adjacency poset has dimensio...