Proof of a conjecture on edge coloring of the Kneser graph K(t,2)

DOI10.47443/dml.2023.079OpenAlexW4390580588MaRDI QIDQ6128982

Unnamed Author, R. Srimathi, Appu Muthusamy, S. Ganesamurthy

Publication date: 16 April 2024

Published in: Discrete Mathematics Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.47443/dml.2023.079

zbMATH Keywords

edge coloringregular graphKneser graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph operations (line graphs, products, etc.) (05C76)