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)

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

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)

Cites Work

• On a property of perfect binary codes
• On reconstructive sets of vertices in the Boolean cube
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On circular perfect two-color colorings
• 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
• Perfect colorings of the prism graph
• Perfect 2-colorings of infinite circulant graphs with continuous set of 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)