Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰
From MaRDI portal
Publication:5085697
DOI10.31801/cfsuasmas.524481zbMath1492.05053OpenAlexW2921838750MaRDI QIDQ5085697
Publication date: 27 June 2022
Published in: Communications Faculty Of Science University of Ankara Series A1Mathematics and Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.31801/cfsuasmas.524481
Cites Work
- Equitable colorings of Kronecker products of graphs
- A sufficient condition for equitable edge-colourings of simple graphs
- Equitable edge-colorings of simple graphs
- The Kronecker Product of Graphs
- Equitable Coloring
- EQUITABLE EDGE CHROMATIC NUMBER OF MYCIELSKIAN OF GRAPHS
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Equitable edge chromatic number of P_{m}⊗S_{n}⁰ and S_{m}⁰⊗S_{n}⁰