The excessive [3]-index of all graphs.
Cariolaro, David, Fu, Hung-Lin (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Displaying similar documents to “Circular chromatic index of generalized Blanuša snarks.”
The excessive [3]-index of all graphs.
A note on edge-colourings avoiding rainbow and monochromatic .
Jungić, Veselin, Kaiser, Tomás, Král', Daniel (2009)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
The circular chromatic index of flower snarks.
Ghebleh, Mohammad, Kral', Daniel, Norine, Serguei, Thomas, Robin (2006)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
Colouring the petals of a graph.
Cariolaro, David, Cariolaro, Gianfranco (2003)
The Electronic Journal of Combinatorics [electronic only]
Similarity:
A structural property of planar graphs and the simultaneous colouring of their edges and faces
Oleg V. Borodin (1990)
Mathematica Slovaca
Similarity:
Characterization of magic graphs
Samuel Jezný, Marián Trenkler (1983)
Czechoslovak Mathematical Journal
Similarity:
Decompositions of Plane Graphs Under Parity Constrains Given by Faces
Július Czap, Zsolt Tuza (2013)
Discussiones Mathematicae Graph Theory
Similarity:
An edge coloring of a plane graph G is facially proper if no two faceadjacent edges of G receive the same color. A facial (facially proper) parity edge coloring of a plane graph G is an (facially proper) edge coloring with the property that, for each color c and each face f of G, either an odd number of edges incident with f is colored with c, or color c does not occur on the edges of f. In this paper we deal with the following question: For which integers k does there exist a facial...