Zobrazeno 1 - 7
of 7
pro vyhledávání: '"Marin, Malory"'
In 1949, Zykov proposed the first explicit construction of triangle-free graphs with arbitrarily large chromatic number. We define a Zykov graph as any induced subgraph of a graph created using Zykov's construction. We give a structural characterizat
Externí odkaz:
http://arxiv.org/abs/2410.06917
We revisit the classical problem of channel allocation for Wi-Fi access points (AP). Using mechanisms such as the CSMA/CA protocol, Wi-Fi access points which are in conflict within a same channel are still able to communicate to terminals. In graph t
Externí odkaz:
http://arxiv.org/abs/2408.14633
We prove a number of results related to the computational complexity of recognizing well-covered graphs. Let $k$ and $s$ be positive integers and let $G$ be a graph. Then $G$ is said - $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent verte
Externí odkaz:
http://arxiv.org/abs/2404.07853
Autor:
Feghali, Carl, Marin, Malory
Let $k \geq 1$. A graph $G$ is $\mathbf{W_k}$ if for any $k$ pairwise disjoint independent vertex subsets $A_1, \dots, A_k$ in $G$, there exist $k$ pairwise disjoint maximum independent sets $S_1, \dots, S_k$ in $G$ such that $A_i \subseteq S_i$ for
Externí odkaz:
http://arxiv.org/abs/2307.15573
Publikováno v:
In Theoretical Computer Science 2 March 2025 1029
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.