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

DOI10.47443/DML.2023.079OpenAlexW4390580588MaRDI QIDQ6128982FDOQ6128982

Authors: S. Ganesamurthy, A. Muthusamy, R. Srimathi 

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

Recommendations

• On total and edge coloring some Kneser graphs
• A new coloring theorem of Kneser graphs
• scientific article; zbMATH DE number 68344
• A NOTE ON COLOURING OF COMPLETE GRAPHS
• A conjecture on edge coloring of graphs

zbMATH Keywords

Kneser graphedge coloringregular graph

Mathematics Subject Classification ID

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

This page was built for publication: Proof of a conjecture on edge coloring of the Kneser graph K(t,2)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6128982)