71 research outputs found
Distance coloring of the hexagonal lattice
Motivated by the frequency assignment problem we study the d-distant coloring of the vertices of an infinite plane hexagonal lattice H. Let d be a positive integer. A d-distant coloring of the lattice H is a coloring of the vertices of H such that each pair of vertices distance at most d apart have different colors. The d-distant chromatic number of H, denoted χd(H), is the minimum number of colors needed for a d-distant coloring of H. We give the exact value of χd(H) for any d odd and estimations for any d even
Lightweight paths in graphs
Let k be a positive integer, G be a graph on V(G) containing a path on k vertices, and w be a weight function assigning each vertex v ∈ V(G) a real weight w(y). Upper bounds on the weight [formula] of P are presented, where P is chosen among all paths of G on k vertices with smallest weight
An inequality concerning edges of minor weight in convex 3-polytopes
Let be the number of edges in a convex 3-polytope joining the vertices of degree i with the vertices of degree j. We prove that for every convex 3-polytope there is ; moreover, each coefficient is the best possible. This result brings a final answer to the conjecture raised by B. Grünbaum in 1973
On Specific Factors in Graphs
It is well known that if G=(V,E) is a connected multigraph and X subset of V is a subset of even order, then G contains a spanning forest H such that each vertex from X has an odd degree in H and all the other vertices have an even degree in H. This spanning forest may have isolated vertices. If this is not allowed in H, then the situation is much more complicated. In this paper, we study this problem and generalize the concepts of even-factors and odd-factors in a unified form
On long cycles through four prescribed vertices of a polyhedral graph
For a 3-connected planar graph G with circumference c ≥ 44 it is proved that G has a cycle of length at least [1/36]c+[20/3] through any four vertices of G
On vertices enforcing a Hamiltonian cycle
A nonempty vertex set X ⊆ V(G) of a hamiltonian graph G is called an of G if every X-cycle of G (i.e. a cycle of G containing all vertices of X) is hamiltonian. The h(G) of a graph G is defined to be the smallest cardinality of an H-force set of G. In the paper the study of this parameter is introduced and its value or a lower bound for outerplanar graphs, planar graphs, k-connected graphs and prisms over graphs is determined
On the Strong Parity Chromatic Number
International audienceA vertex colouring of a 2-connected plane graph G is a strong parity vertex colouring if for every face f and each colour c, the number of vertices incident with f coloured by c is either zero or odd. Czap et al. [Discrete Math. 311 (2011) 512-520] proved that every 2-connected plane graph has a proper strong parity vertex colouring with at most 118 colours. In this paper we improve this upper bound for some classes of plane graphs
- …