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...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia
2016-10-01
|
| Rangatū: | Electronic Journal of Graph Theory and Applications |
| Ngā marau: | |
| Urunga tuihono: | http://www.ejgta.org/index.php/ejgta/article/view/184 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|