Recognizing Circulant Graphs of Prime Order in Polynomial Time

Electronic Journal of Combinatorics - United States
doi 10.37236/1363
Full Text
Abstract

Available in full text

Date
Authors
Publisher

The Electronic Journal of Combinatorics

Related search

A Robot Vision System for Recognizing 3D Objects in Low-Order Polynomial Time

IEEE Transactions on Systems, Man, and Cybernetics
1989English

Vertex-Transitive Graphs of Prime-Squared Order Are Hamilton-Decomposable

Journal of Combinatorial Designs
CombinatoricsDiscrete Mathematics
2013English

Frobenius Circulant Graphs of Valency Four

Journal of the Australian Mathematical Society
Mathematics
2008English

TETRAVALENT S-Transitive GRAPHS OF ORDER TWICE a PRIME POWER

Journal of the Australian Mathematical Society
Mathematics
2010English

The Prime Factors of Wendt’s Binomial Circulant Determinant

Mathematics of Computation
Computational MathematicsApplied MathematicsNumber TheoryAlgebra
1991English

Automorphisms of Cayley Graphs of Metacyclic Groups of Prime-Power Order

Journal of the Australian Mathematical Society
Mathematics
2001English

Polynomial-Time Approximation Schemes for Geometric Intersection Graphs

SIAM Journal on Computing
MathematicsComputer Science
2005English

Prime Elements and Prime Sequences in Polynomial Rings

Proceedings of the American Mathematical Society
MathematicsApplied Mathematics
1978English

Approximating Chromatic Sum Coloring of Bipartite Graphs in Expected Polynomial Time

Proceedings of the Institute for System Programming of RAS
2015English

Amanote Research

Note-taking for researchers

Follow Amanote

© 2024 Amaplex Software S.P.R.L. All rights reserved.

Privacy PolicyRefund Policy