The First Order Theory of $N$-Colorable Graphs

Transactions of the American Mathematical Society - United States
doi 10.1090/s0002-9947-1979-0530057-2
Full Text
Abstract

Available in full text

Date
Authors
Publisher

American Mathematical Society (AMS)

Related search

A Note on Uniquely H-Colorable Graphs

Discussiones Mathematicae - Graph Theory
CombinatoricsApplied MathematicsDiscrete Mathematics
2007English

Coloring Random and Semi-Random K-Colorable Graphs

Journal of Algorithms
1995English

Almost All K-Colorable Graphs Are Easy to Color

Journal of Algorithms
1988English

First Order Theory of Permutation Groups

Israel Journal of Mathematics
Mathematics
1973English

The First and Second Order Equations of the Quantum Theory

Proceedings of the Royal Society of London. Series A, Containing Papers of a Mathematical and Physical Character
1929English

Homotopy-Theoretic E-Theory and $$N$$ -Order

Journal of Homotopy and Related Structures
GeometryTopologyNumber TheoryAlgebra
2013English

The Hanf Number of the First Order Theory of Banach Spaces

Transactions of the American Mathematical Society
MathematicsApplied Mathematics
1978English

Smaller Planar Triangle-Free Graphs That Are Not 3-List-Colorable

Discrete Mathematics
CombinatoricsTheoretical Computer ScienceDiscrete Mathematics
2005English

An Expected Polynomial Time Algorithm for Coloring 2-Colorable 3-Graphs

Electronic Notes in Discrete Mathematics
CombinatoricsApplied MathematicsDiscrete Mathematics
2009English

Amanote Research

Note-taking for researchers

Follow Amanote

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

Privacy PolicyRefund Policy