Perfect 2-coloring of the quartic graphs with order at most 8
From MaRDI portal
Publication:2179007
DOI10.1007/s40096-019-00294-9zbMath1452.05059OpenAlexW2971819387WikidataQ127299921 ScholiaQ127299921MaRDI QIDQ2179007
Yazdan Golzadeh, Mehdi Alaeiyan, Alireza Gilani
Publication date: 12 May 2020
Published in: Mathematical Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s40096-019-00294-9
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Perfect 2-colorings of the generalized Petersen graph
- Compact graphs and equitable partitions
- On the regularity of perfect 2-colorings of the Johnson graph
- Perfect 2-Colorings of Johnson Graphs J(6,3) and J(7,3)
- On Perfect 2‐Colorings of Johnson Graphs J(v, 3)
- On perfect codes and related concepts
- Unnamed Item
- Unnamed Item
This page was built for publication: Perfect 2-coloring of the quartic graphs with order at most 8