✦ LIBER ✦

An edge-coloration theorem for bipartite graphs with applications

✍ Scribed by Ram Prakash Gupta

Publisher: Elsevier Science
Year: 1978
Tongue: English
Weight: 776 KB
Volume: 23
Category: Article
ISSN: 0012-365X
DOI: 10.1016/0012-365x(78)90004-3

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Analysis of approximate algorithms for e

Analysis of approximate algorithms for edge-coloring bipartite graphs

✍ Ravi Jain; John Werth 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 513 KB

An edge grafting theorem on the energy o

An edge grafting theorem on the energy of unicyclic and bipartite graphs

✍ Hai-Ying Shan; Jia-Yu Shao; Fei Gong; Yue Liu 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 159 KB

The energy of a graph is the sum of the absolute values of the eigenvalues of its adjacency matrix. The edge grafting operation on a graph is certain kind of edge moving between two pendant paths starting from the same vertex. In this paper we show how the graph energy changes under the edge graftin

Edge-colored graphs with applications to

Edge-colored graphs with applications to homogeneous faults

✍ Yongge Wang; Yvo Desmedt 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 236 KB

An edge coloring problem for graph produ

An edge coloring problem for graph products

✍ Faudree, R. J.; Gy�rf�s, Andr�as; Schelp, R. H. 📂 Article 📅 1996 🏛 John Wiley and Sons 🌐 English ⚖ 315 KB 👁 1 views

The edges of the Cartesian product of graphs G x H a r e to be colored with the condition that all rectangles, i.e., K2 x K2 subgraphs, must be colored with four distinct colors. The minimum number of colors in such colorings is determined for all pairs of graphs except when G is 5-chromatic and H

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.

Fixed-edge theorem for graphs with loops

✍ Richard Nowakowski; Ivan Rival 📂 Article 📅 1979 🏛 John Wiley and Sons 🌐 English ⚖ 521 KB

## Abstract Let __G__ be an undirected graph without multiple edges and with a loop at every vertex—the set of edges of __G__ corresponds to a reflexive and symmetric binary relation on its set of vertices. Then __every edge‐preserving map of the set of vertices of G to itself fixes an edge__ [{__f