On a problem of colouring the real plane

Filip Guldan

Displaying similar documents to “On a problem of colouring the real plane”

Locally disconnected graphs with large numbers of edges

Zdeněk Ryjáček, Bohdan Zelinka (1987)

Mathematica Slovaca

Similarity:

On the crossing numbers of $S_{m} \times P_{n}$ and $S_{m} \times C_{n}$

Stanislav Jendroľ, Mária Ščerbová (1982)

Časopis pro pěstování matematiky

Similarity:

Acyclic chromatic index of a graph with maximum valency three

Jozef Fiamčík (1980)

Archivum Mathematicum

Similarity:

Acyclic chromatic index of a subdivided graph

Jozef Fiamčík (1984)

Archivum Mathematicum

Similarity:

On arc-coloring of subcubic graphs.

Pinlou, Alexandre (2006)

The Electronic Journal of Combinatorics [electronic only]

Similarity:

On the strong parity chromatic number

Július Czap, Stanislav Jendroľ, František Kardoš (2011)

Discussiones Mathematicae Graph Theory

Similarity:

A 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. in [9] 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.

Displaying similar documents to “On a problem of colouring the real plane”

Locally disconnected graphs with large numbers of edges

On the crossing numbers of S m × P n and S m × C n

Acyclic chromatic index of a graph with maximum valency three

Acyclic chromatic index of a subdivided graph

On arc-coloring of subcubic graphs.

On the strong parity chromatic number

On the crossing numbers of $S_{m} \times P_{n}$ and $S_{m} \times C_{n}$