Electronic Journal of Graph Theory and Applications (EJGTA)
Vol 4, No 2 (2016): Electronic Journal of Graph Theory and Applications

Graphs with coloring redundant edges

Bart Demoen (KU Leuven, Belgium)
Phuong-Lan Nguyen (UCO, Angers, France)

Article Info

Publish Date
08 Oct 2016

Abstract

A graph edge is $d$-coloring redundant if the removal of the edge doesnot change the set of $d$-colorings of the graph. Graphs that are toosparse or too dense do not have coloring redundant edges. Tight upperand lower bounds on the number of edges in a graph in order for thegraph to have a coloring redundant edge are proven. Two constructionslink the class of graphs with a coloring redundant edge to the$K_4$-free graphs and to the uniquely colorable graphs. The structureof graphs with a coloring redundant edge is explored.

Copyrights © 2016




Citation Download
RIS
EndNote, Reference Manager, ProCite
BibTex
Latex, Jabref
Original Source
Download Original
Google Scholar
Check in Google Scholar
Journal Info
Electronic Journal of Graph Theory and Applications (EJGTA)
Website

Abbrev

ejgta

Publisher

Indonesian Combinatorial Society

Subject

Electrical & Electronics Engineering

Description

The Electronic Journal of Graph Theory and Applications (EJGTA) is a refereed journal devoted to all areas of modern graph theory together with applications to other fields of mathematics, computer science and other sciences. The journal is published by the Indonesian Combinatorial Society ...