A Note on Semi-coloring of Graphs

A Note on Semi-coloring of Graphs

Semi-coloring is a new type of edge coloring of graphs. In this note, we show that every graph has a semi-coloring. This answers a problem, posed by Daniely and Linial, in affirmative. It implies that every r -regular graph has at least different { K 2 , C i | i  ≥ 3}-factors.

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:Graphs and combinatorics 2013-07, Vol.29 (4), p.1135-1140
Hauptverfasser: Wu, Baoyindureng, Deng, Xingchao, An, Xinhui, Yan, Guiying
Format: Artikel
Sprache:eng
Schlagworte:
Coloring
Combinatorial analysis
Combinatorics
Engineering Design
Graph coloring
Graph theory
Graphs
Mathematics
Mathematics and Statistics
Original Paper
Online-Zugang:Volltext
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:Semi-coloring is a new type of edge coloring of graphs. In this note, we show that every graph has a semi-coloring. This answers a problem, posed by Daniely and Linial, in affirmative. It implies that every r -regular graph has at least different { K 2 , C i | i  ≥ 3}-factors.
ISSN:0911-0119
1435-5914
DOI:10.1007/s00373-012-1171-1