✦ LIBER ✦

Generalization of a theorem of Kotzig and a prescribed coloring of the edges of planar graphs

✍ Scribed by O. V. Borodin

Publisher: SP MAIK Nauka/Interperiodica
Year: 1990
Tongue: English
Weight: 418 KB
Volume: 48
Category: Article
ISSN: 0001-4346
DOI: 10.1007/bf01240258

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A generalization of edge-coloring in gra

A generalization of edge-coloring in graphs

✍ S. Louis Hakimi; Oded Kariv 📂 Article 📅 1986 🏛 John Wiley and Sons 🌐 English ⚖ 754 KB

Bounds are given on the number of colors required to color the edges of a graph (multigraph) such that each color appears at each vertex u at most m(u) times. The known results and proofs generalize in natural ways. Certain new edge-coloring problems, which have no counterparts when m(u) = 1 for all

Structure of neighborhoods of edges in p

Structure of neighborhoods of edges in planar graphs and simultaneous coloring of vertices, edges and faces

✍ O. V. Borodin 📂 Article 📅 1993 🏛 SP MAIK Nauka/Interperiodica 🌐 English ⚖ 667 KB

A six-color theorem for the edge-face co

A six-color theorem for the edge-face coloring of plane graphs

✍ Cuiqin Lin; Guanzhang Hu; Zhongfu Zhang 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 218 KB

It was shown (Kronk and Mitchen, 1973) that the set of vertices, edges and faces of any normal map on the sphere can be colored with seven colors. In this paper we solve a somewhat different problem: the set of edges and faces of any plane graph with A ~< 3 can be colored by six colors.

Strongly edge triangle regular graphs an

Strongly edge triangle regular graphs and a conjecture of Kotzig

✍ B.Radhakrishnan Nair; A. Vijayakumar 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 513 KB

The concepts of strongly vertex triangle regular graphs and strongly edge triangle regular graphs are introduced. An expression for the triangle number of a vertex in the composition of two graphs is obtained. It is proved that a self-complementary graph is strongly regular if and only if it is stro

NP-completeness of list coloring and pre

NP-completeness of list coloring and precoloring extension on the edges of planar graphs

✍ Dániel Marx 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 110 KB

## Abstract In the edge precoloring extension problem, we are given a graph with some of the edges having preassigned colors and it has to be decided whether this coloring can be extended to a proper __k__‐edge‐coloring of the graph. In list edge coloring every edge has a list of admissible colors,

Computer generation of edge groups and e

Computer generation of edge groups and edge colorings of graphs

✍ Xiaoyu Liu; K. Balasubramanian 📂 Article 📅 1989 🏛 John Wiley and Sons 🌐 English ⚖ 810 KB

A computer code and nonnumerical algorithm are developed to construct the edge group of a graph and to enumerate the edge colorings of graphs of chemical interest. The edge colorings of graphs have many applications in nuclear magnetic resonance (NMR), multiple quantum NMR, enumeration of structural