Back to Search Start Over

The Existence of Semi-colorings in a Graph.

Authors :
Furuya, Michitaka
Kamada, Masaru
Ozeki, Kenta
Source :
Graphs & Combinatorics. Sep2015, Vol. 31 Issue 5, p1397-1401. 5p.
Publication Year :
2015

Abstract

A semi-coloring is a fractional-type edge coloring of graphs. Daniely and Linial (J Graph Theory 69:426-440, ) conjectured that every graph has a semi-coloring. In this paper, we give an affirmative answer to this conjecture by considering a $$2$$ -factor in almost regular graphs. [ABSTRACT FROM AUTHOR]

Subjects

Subjects :
*GRAPH theory
*EXISTENCE theorems
*GRAPH coloring
*PATHS & cycles in graph theory
*FRACTIONAL calculus

Details

Language :
English
ISSN :
09110119
Volume :
31
Issue :
5
Database :
Academic Search Index
Journal :
Graphs & Combinatorics
Publication Type :
Academic Journal
Accession number :
109077677
Full Text :
https://doi.org/10.1007/s00373-014-1445-x
Full Text Access
View/download PDF

Tools

Authors Abstract Subjects Details