Cyclic graphs
From MaRDI portal
DOI10.1016/S0166-218X(99)00121-3zbMATH Open0942.05048OpenAlexW2913556564MaRDI QIDQ1962030FDOQ1962030
Authors: Yanyan Li
Publication date: 21 August 2000
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(99)00121-3
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Distance in graphs (05C12) Coloring of graphs and hypergraphs (05C15)
Cites Work
Cited In (17)
- Vertex-colouring of 3-chromatic circulant graphs
- Cycle Kronecker products that are representable as optimal circulants
- Title not available (Why is that?)
- Minimum chromaticity of circulant graphs
- The isomorphism problem for circulant graphs via Schur ring theory
- Cyclic Inclusion-Exclusion
- Tight-optimal circulants vis-à-vis twisted tori
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Dense bipartite circulants and their routing via rectangular twisted torus
- Title not available (Why is that?)
- A survey on undirected circulant graphs
- Cyclic Haar graphs
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
This page was built for publication: Cyclic graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1962030)