𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Partitions and Edge-Weighted Pair-Graphs

✍ Scribed by Small, A.W.

Book ID
114605515
Publisher
IEEE
Year
1968
Tongue
English
Weight
172 KB
Volume
C-17
Category
Article
ISSN
0018-9340

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Vertex partitions ofr-edge-colored graph
Vertex partitions ofr-edge-colored graphs
✍ Ze-min Jin; Xue-liang Li πŸ“‚ Article πŸ“… 2008 πŸ› SP Editorial Committee of Applied Mathematics - A 🌐 English βš– 145 KB
Partitioning multi-edge graphs
Partitioning multi-edge graphs
✍ Ravi Varadarajan πŸ“‚ Article πŸ“… 1990 πŸ› Springer Netherlands 🌐 English βš– 781 KB
Monochromatic cycle partitions of edge-c
Monochromatic cycle partitions of edge-colored graphs
✍ GΓ‘bor N. SΓ‘rkΓΆzy πŸ“‚ Article πŸ“… 2010 πŸ› John Wiley and Sons 🌐 English βš– 88 KB πŸ‘ 1 views

In this article we study the monochromatic cycle partition problem for non-complete graphs. We consider graphs with a given independence number (G) = . Generalizing a classical conjecture of Erd" os, GyΓ‘rfΓ‘s and Pyber, we conjecture that if we r-color the edges of a graph G with (G) = , then the ver

Circular colorings of edge-weighted grap
Circular colorings of edge-weighted graphs
✍ Bojan Mohar πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 99 KB

## Abstract The notion of (circular) colorings of edge‐weighted graphs is introduced. This notion generalizes the notion of (circular) colorings of graphs, the channel assignment problem, and several other optimization problems. For instance, its restriction to colorings of weighted complete graphs