Asymmetric Two-Colourings of Graphs in S3

Mathematical Proceedings of the Cambridge Philosophical Society - United Kingdom
doi 10.1017/s0305004101005643
Full Text
Abstract

Available in full text

Categories
Mathematics
Date
Authors
Publisher

Cambridge University Press (CUP)

Related search

Colourings in Bipartite Graphs

International Journal of Computer Applications
2011English

Derived Colourings of Graphs

English

Conflict-Free Colourings of Graphs and Hypergraphs

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2009English

Acyclic Colourings of Planar Graphs With Large Girth

Journal of the London Mathematical Society
Mathematics
1999English

Improved Hardness for H-Colourings of G-Colourable Graphs

2020English

Edge Colourings of Graphs Avoiding Monochromatic Matchings of a Given Size

Combinatorics Probability and Computing
StatisticsProbabilityApplied MathematicsMathematicsComputational TheoryTheoretical Computer Science
2012English

Colourings and Preservatives in Drugs.

BMJ
1989English

Connectedness of the Graph of Vertex-Colourings

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2008English

The Complexity of Pebbling in Diameter Two Graphs

SIAM Journal on Discrete Mathematics
Mathematics
2012English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy