Test fragments of perfect colorings of circulant graphs

DOI10.33048/SEMI.2023.20.038zbMATH Open1543.05057MaRDI QIDQ6587403FDOQ6587403

Authors Mariya Aleksandrovna Lisitsyna, Sergey Avgustinovich 

Publication date 14 August 2024

Published in Sibirskie Elektronnye Matematicheskie Izvestiya (Search for Journal in Brave)

zbMATH Keywords

perfect coloringinfinite circulant graph\(k\)-test fragment

Mathematics Subject Classification ID

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

Recommendations

• The perfect colorings of circulant graphs with a large number of colors
• Perfect 2-colorings of infinite circulant graphs with continuous set of distances
• Perfect colorings of the infinite circulant graph with distances 1 and 2
• New perfect colorings of infinite circulant graphs with continuous sets of distanses
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances

Cites work

• scientific article; zbMATH DE number 6007921 (Why is no real title available?)
• scientific article; zbMATH DE number 2165229 (Why is no real title available?)
• scientific article; zbMATH DE number 3255492 (Why is no real title available?)
• New perfect colorings of infinite circulant graphs with continuous sets of distanses
• On a property of perfect binary codes
• On circular perfect two-color colorings
• On reconstructive sets of vertices in the Boolean cube
• Perfect 2-colorings of infinite circulant graphs with continuous set of distances
• Perfect colorings of the infinite circulant graph with distances 1 and 2
• Perfect colorings of the prism graph
• The perfect 2-colorings of infinite circulant graphs with a continuous set of odd distances

This page was built for publication: Test fragments of perfect colorings of circulant graphs

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