Highly Influenced

# Simultaneously Colouring the Edges and Faces of Plane Graphs

@article{Waller1997SimultaneouslyCT, title={Simultaneously Colouring the Edges and Faces of Plane Graphs}, author={Adrian O. Waller}, journal={J. Comb. Theory, Ser. B}, year={1997}, volume={69}, pages={219-221} }

- Published 1997 in J. Comb. Theory, Ser. B
DOI:10.1006/jctb.1997.1725

The elements of a plane graph G are the edges, vertices, and faces of G. We say that two elements are neighbours in G if they are incident with or are mutually adjacent with each other in G. The simultaneous colouring of distinct elements of a planar graph was first introduced by Ringel [12]. In his paper Ringel considered the problem of colouring the vertices and faces of a plane graph in such a way that every vertex and face receives a different colour from any of its neighbouring vertices… CONTINUE READING

#### From This Paper

##### Topics from this paper.

#### Citations

##### Publications citing this paper.

#### References

##### Publications referenced by this paper.

Showing 1-10 of 10 references