Counterexamples to a conjecture on matching Kneser graphs
Let $G$ be a graph and $r\in\mathbb{N}$. The matching Kneser graph $\textsf{KG}(G, rK_2)$ is a graph whose vertex set is the set of $r$-matchings in $G$ and two vertices are adjacent if their corresponding matchings are edge-disjoint. In [M. Alishahi and H. Hajiabolhassan, On the Chromatic Number of...
| Main Author: | |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
University of Isfahan
2023-09-01
|
| Series: | Transactions on Combinatorics |
| Subjects: | |
| Online Access: | https://toc.ui.ac.ir/article_26847_9307b1b5b45d7de0418b8b8b2bb530fc.pdf |