641 search results - page 41 / 129 » On Planar Quasi-Parity Graphs |
110
click to vote
JCT
2007
15 years 1 months ago
2007
We conjecture that every planar graph of odd-girth 2k + 1 admits a homomorphism to Cayley graph C(Z2k+1 2 , S2k+1), with S2k+1 being the set of (2k + 1)vectors with exactly two co...
JCT
2006
15 years 1 months ago
2006
: We prove that every triangle-free planar graph on n vertices with maximum degree three has an independent set with size at least 3 8 n. This was suggested and later conjectured b...
122
click to vote
STOC
2009
ACM
16 years 2 months ago
2009
ACM
We study the topological simplification of graphs via random embeddings, leading ultimately to a reduction of the Gupta-Newman-Rabinovich-Sinclair (GNRS) L1 embedding conjecture t...
CCCG
2009
15 years 3 months ago
2009
We prove that, for every two n-node non-star trees of diameter at most four, there exists an n-node planar graph containing them as edge-disjoint subgraphs.
108
click to vote
ATMOS
2010
15 years 28 days ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...