Zobrazeno 1 - 10
of 125
pro vyhledávání: '"improper colouring"'
Publikováno v:
In Journal of Discrete Algorithms October 2012 16:53-66
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Publikováno v:
In Discrete Mathematics 2008 308(8):1438-1454
Publikováno v:
Discrete Mathematics & Theoretical Computer Science, Vol DMTCS Proceedings vol. AE,..., Iss Proceedings (2005)
For any graph $G$, the $k$-improper chromatic number $χ ^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$. We investigate the ratio of the $k$-improper chromatic
Externí odkaz:
https://doaj.org/article/2735d55754f6457daf4b9e8dcb44a7ff
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Dong Yeap Kang, Sang-il Oum
Publikováno v:
Combinatorics, Probability and Computing. 28:740-754
As a strengthening of Hadwiger's conjecture, Gerards and Seymour conjectured that every graph with no odd $K_t$ minor is $(t-1)$-colorable. We prove two weaker variants of this conjecture. Firstly, we show that for each $t \geq 2$, every graph with n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::88b0f44932550264ba71b2ae78bd3592
https://doi.org/10.1017/s0963548318000548
https://doi.org/10.1017/s0963548318000548
Publikováno v:
Discrete Mathematics and Theoretical Computer Science
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.193-198
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.193-198, ⟨10.46298/dmtcs.3402⟩
[Research Report] RR-5761, INRIA. 2005, pp.18
Discrete Mathematics, 308(8), 1438-1454. Elsevier
Discrete Mathematics, 308(8), 1438-1454
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05)
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.193-198
2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.193-198, ⟨10.46298/dmtcs.3402⟩
[Research Report] RR-5761, INRIA. 2005, pp.18
Discrete Mathematics, 308(8), 1438-1454. Elsevier
Discrete Mathematics, 308(8), 1438-1454
For any graph G, the k-improper chromatic [email protected]^k(G) is the smallest number of colours used in a colouring of G such that each colour class induces a subgraph of maximum degree k. We investigate @g^k for unit disk graphs and random unit d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::c6547a43f0688d7ff2228bb12bdf6d92
https://doi.org/10.1016/j.disc.2007.07.070
https://doi.org/10.1016/j.disc.2007.07.070
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Jean-Claude Bermond, Remigiusz Modrzejewski, Júlio Araújo, Frédéric Havet, Frédéric Giroire, Dorian Mazauric
Publikováno v:
22th International Workshop, IWOCA 2011
22th International Workshop, IWOCA 2011, Jul 2011, Victoria, Canada
Journal of Discrete Algorithms
Journal of Discrete Algorithms, Elsevier, 2012, 16, pp.53-66. ⟨10.1016/j.jda.2012.07.001⟩
Lecture Notes in Computer Science ISBN: 9783642250101
IWOCA
[Research Report] RR-7590, INRIA. 2011, pp.57
Journal of Discrete Algorithms, 2012, 16, pp.53-66. ⟨10.1016/j.jda.2012.07.001⟩
22th International Workshop, IWOCA 2011, Jul 2011, Victoria, Canada
Journal of Discrete Algorithms
Journal of Discrete Algorithms, Elsevier, 2012, 16, pp.53-66. ⟨10.1016/j.jda.2012.07.001⟩
Lecture Notes in Computer Science ISBN: 9783642250101
IWOCA
[Research Report] RR-7590, INRIA. 2011, pp.57
Journal of Discrete Algorithms, 2012, 16, pp.53-66. ⟨10.1016/j.jda.2012.07.001⟩
In this paper, we study a colouring problem motivated by a practical frequency assignment problem and, up to our best knowledge, new. In wireless networks, a node interferes with other nodes, the level of interference depending on numerous parameters
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::bcc3c8c67e8a5c4f1187448e6a4c5403
https://inria.hal.science/inria-00635882
https://inria.hal.science/inria-00635882
