From light edges to strong edge-colouring of 1-planar graphs
A strong edge-colouring of an undirected graph $G$ is an edge-colouring where every two edges at distance at most~$2$ receive distinct colours. The strong chromatic index of $G$ is the least number of colours in a strong edge-colouring of $G$. A conjecture of Erd\H{o}s and Ne\v{s}et\v{r}il, stated b...
সংরক্ষণ করুন:
| প্রধান লেখক: | , , , |
|---|---|
| বিন্যাস: | Artigo |
| ভাষা: | Inglês |
| প্রকাশিত: |
Discrete Mathematics & Theoretical Computer Science
2020-01-01
|
| মালা: | Discrete Mathematics & Theoretical Computer Science |
| বিষয়গুলি: | |
| অনলাইন ব্যবহার করুন: | https://dmtcs.episciences.org/5404/pdf |
| ট্যাগগুলো: |
কোনো ট্যাগ নেই, প্রথমজন হিসাবে ট্যাগ করুন!
|