Colouring the petals of a graph.
Cariolaro, David, Cariolaro, Gianfranco (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
The search session has expired. Please query the service again.
Cariolaro, David, Cariolaro, Gianfranco (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Juraj Bosák (1972)
Czechoslovak Mathematical Journal
Similarity:
E.J. Cockayne, C.M. Mynhardt (1999)
Discussiones Mathematicae Graph Theory
Similarity:
A set X of vertices of a graph G is said to be 1-dependent if the subgraph of G induced by X has maximum degree one. The 1-dependent Ramsey number t₁(l,m) is the smallest integer n such that for any 2-edge colouring (R,B) of Kₙ, the spanning subgraph B of Kₙ has a 1-dependent set of size l or the subgraph R has a 1-dependent set of size m. The 2-edge colouring (R,B) is a t₁(l,m) Ramsey colouring of Kₙ if B (R, respectively) does not contain a 1-dependent set of size l (m, respectively);...
Dănuţ Marcu (1996)
Mathematica Bohemica
Similarity:
In this paper, we give some results concerning the colouring of the product (cartesian product) of two graphs.
Peter Mihók, Janka Oravcová, Roman Soták (2011)
Discussiones Mathematicae Graph Theory
Similarity:
Let P be a graph property and r,s ∈ N, r ≥ s. A strong circular (P,r,s)-colouring of a graph G is an assignment f:V(G) → {0,1,...,r-1}, such that the edges uv ∈ E(G) satisfying |f(u)-f(v)| < s or |f(u)-f(v)| > r - s, induce a subgraph of G with the propery P. In this paper we present some basic results on strong circular (P,r,s)-colourings. We introduce the strong circular P-chromatic number of a graph and we determine the strong circular P-chromatic number of complete graphs for...