Sciweavers

1749 search results - page 110 / 350
» Conditional colorings of graphs
Sort
View
WAW
2007
Springer
120views Algorithms» more  WAW 2007»
16 years 17 days ago
Giant Component and Connectivity in Geographical Threshold Graphs
The geographical threshold graph model is a random graph model with nodes distributed in a Euclidean space and edges assigned through a function of distance and node weights. We st...
Milan Bradonjic, Aric A. Hagberg, Allon G. Percus
SIAMDM
2008
140views more  SIAMDM 2008»
15 years 6 months ago
Bounds for the Real Number Graph Labellings and Application to Labellings of the Triangular Lattice
We establish new lower and upper bounds for the real number graph labelling problem. As an application, we completely determine the optimum spans of L(p, q)-labellings of the infin...
Daniel Král, Petr Skoda
EJC
2010
15 years 6 months ago
Perfect matchings with restricted intersection in cubic graphs
A conjecture of G. Fan and A. Raspaud asserts that every bridgeless cubic graph contains three perfect matchings with empty intersection. We suggest a possible approach to problem...
Tomás Kaiser, André Raspaud
COMBINATORICS
2004
108views more  COMBINATORICS 2004»
15 years 6 months ago
On the Chromatic Number of Intersection Graphs of Convex Sets in the Plane
Let G be the intersection graph of a finite family of convex sets obtained by translations of a fixed convex set in the plane. We show that every such graph with clique number k i...
Seog-Jin Kim, Alexandr V. Kostochka, Kittikorn Nak...
IWOCA
2009
Springer
160views Algorithms» more  IWOCA 2009»
15 years 11 months ago
Note on Decomposition of Kn, n into (0, j)-prisms
R. H¨aggkvist proved that every 3-regular bipartite graph of order 2n with no component isomorphic to the Heawood graph decomposes the complete bipartite graph K6n,6n. In [2] the ...
Sylwia Cichacz, Dalibor Froncek, Petr Kovár