Graphs with coloring redundant edges
<p>A graph edge is $d$-coloring redundant if the removal of the edge does<br />not change the set of $d$-colorings of the graph. Graphs that are too<br />sparse or too dense do not have coloring redundant edges. Tight upper<br />and lower bounds on the number of edges in a graph in order for the<br...
Furkejuvvon:
| Váldodahkkit: | , |
|---|---|
| Materiálatiipa: | Artigo |
| Giella: | Inglês |
| Almmustuhtton: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2016-10-01
|
| Ráidu: | Electronic Journal of Graph Theory and Applications |
| Fáttát: | |
| Liŋkkat: | http://www.ejgta.org/index.php/ejgta/article/view/184 |
| Fáddágilkorat: |
Eai fáddágilkorat, Lasit vuosttaš fáddágilkora!
|