𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Vertex partitions ofr-edge-colored graphs

✍ Scribed by Ze-min Jin; Xue-liang Li

Book ID
107500832
Publisher
SP Editorial Committee of Applied Mathematics - A Journal of Chinese Universities
Year
2008
Tongue
English
Weight
145 KB
Volume
23
Category
Article
ISSN
1005-1031

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

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

Vertex-distinguishing edge colorings of
Vertex-distinguishing edge colorings of graphs
✍ P. N. Balister; O. M. Riordan; R. H. Schelp πŸ“‚ Article πŸ“… 2003 πŸ› John Wiley and Sons 🌐 English βš– 136 KB πŸ‘ 1 views
Vertex colouring edge partitions
Vertex colouring edge partitions
✍ L. Addario-Berry; R.E.L. Aldred; K. Dalal; B.A. Reed πŸ“‚ Article πŸ“… 2005 πŸ› Elsevier Science 🌐 English βš– 175 KB
On vertex-coloring edge-weighting of gra
On vertex-coloring edge-weighting of graphs
✍ Hongliang Lu; Xu Yang; Qinglin Yu πŸ“‚ Article πŸ“… 2009 πŸ› Higher Education Press and Springer 🌐 English βš– 159 KB
Vertex partitions of chordal graphs
Vertex partitions of chordal graphs
✍ David R. Wood πŸ“‚ Article πŸ“… 2006 πŸ› John Wiley and Sons 🌐 English βš– 103 KB

## Abstract A __k‐tree__ is a chordal graph with no (__k__ + 2)‐clique. An ℓ‐__tree‐partition__ of a graph __G__ is a vertex partition of __G__ into β€˜bags,’ such that contracting each bag to a single vertex gives an ℓ‐tree (after deleting loops and replacing parallel edges by a single edge). We pro