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: | Moharram N. Iradmusa |
---|---|
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 |
Similar Items
-
Proof of a conjecture on edge coloring of the Kneser graph K(t, 2)
by: L. Panneerselvam, et al.
Published: (2023-12-01) -
On the Altermatic Number of Graphs
by: Hossein Hajiabolhassan, et al.
Published: (2020-05-01) -
The Super-Connectivity of Kneser Graphs
by: Ekinci Gülnaz Boruzanli, et al.
Published: (2019-02-01) -
On incidence coloring of graph fractional powers
by: Mahsa Mozafari-Nia, et al.
Published: (2022-12-01) -
The General Position Problem on Kneser Graphs and on Some Graph Operations
by: Ghorbani Modjtaba, et al.
Published: (2021-11-01)