1997•Discrete MathematicsOpen access
On Ádám's conjecture for circulant graphs
Mikhail Muzychuk
Open full text 27 citations
Abstract
This record does not include an abstract. Use the full-text link above if available.
Open-access reader
Mikhail Muzychuk
Abstract
Open-access reader
An abstract is not available in the OpenAlex record for this paper.
OpenAlex reports 27 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Key concepts: Mathematics, Circulant matrix, Combinatorics, Conjecture, Square-free integer, Circulant graph, Lonely runner conjecture, Discrete mathematics