Star coloring high girth planar graphs.
Timmons, Craig (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Timmons, Craig (2008)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Axenovich, Maria (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Wood, David R. (2005)
Discrete Mathematics and Theoretical Computer Science. DMTCS [electronic only]
Similarity:
Černý, A., Horák, P., Rosa, A., Znám, Š. (1996)
Acta Mathematica Universitatis Comenianae. New Series
Similarity:
Yolandé Jacobs, Elizabeth Jonck, Ernst Joubert (2013)
Open Mathematics
Similarity:
Let G = (V, E) be a simple graph of order n and i be an integer with i ≥ 1. The set X i ⊆ V(G) is called an i-packing if each two distinct vertices in X i are more than i apart. A packing colouring of G is a partition X = {X 1, X 2, …, X k} of V(G) such that each colour class X i is an i-packing. The minimum order k of a packing colouring is called the packing chromatic number of G, denoted by χρ(G). In this paper we show, using a theoretical proof, that if q = 4t, for some integer t...
Juraj Bosák, Jaroslav Nešetřil (1976)
Mathematica Slovaca
Similarity:
Caro, Yair, Yuster, Raphael (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Bohdan Zelinka (1973)
Časopis pro pěstování matematiky
Similarity: