Language
We detect your regional language is French. Do you want to change site's language to French? You may choose other languages.International
English
中文
русск
français
español
العربية
User Center
My Training Class
Feedback
Electronic Journal of Graph Theory and Applications | Vol.4, Issue.2 | | Pages
Graphs with coloring redundant edges
A graph edge is $d$-coloring redundant if the removal of the edge does
not change the set of $d$-colorings of the graph. Graphs that are too
sparse or too dense do not have coloring redundant edges. Tight upper
and lower bounds on the number of edges in a graph in order for the
graph to have a coloring redundant edge are proven. Two constructions
link the class of graphs with a coloring redundant edge to the
$K_4$-free graphs and to the uniquely colorable graphs. The structure
of graphs with a coloring redundant edge is explored.
Original Text (This is the original text for your reference.)
Graphs with coloring redundant edges
A graph edge is $d$-coloring redundant if the removal of the edge does
not change the set of $d$-colorings of the graph. Graphs that are too
sparse or too dense do not have coloring redundant edges. Tight upper
and lower bounds on the number of edges in a graph in order for the
graph to have a coloring redundant edge are proven. Two constructions
link the class of graphs with a coloring redundant edge to the
$K_4$-free graphs and to the uniquely colorable graphs. The structure
of graphs with a coloring redundant edge is explored.
+More
APA
MLA
Chicago
Bart Demoen,Phuong-Lan Nguyen,.Graphs with coloring redundant edges. 4 (2),.
Translate engine
Article's language
Action
Report
Share
Recommended articles
Report
Select your report category*
Reason*
Your level privilege is in sufficient. You can go to the “User Center” to view your level information and perform points tasks to upgrade your level.
New sign-in location：
Last sign-in location：
Last sign-in date：
About to jump to an external site.
Security unknown, whether to continue