Discrete Mathematics & Theoretical Computer Science (May 2011)

An expected polynomial time algorithm for coloring 2-colorable 3-graphs

Yury Person,
Mathias Schacht

Affiliations

Yury Person: ORCiD; Institut für Mathematik [Berlin]
Mathias Schacht: ORCiD; Fachbereich Mathematik [Hamburg]

DOI: https://doi.org/10.46298/dmtcs.558
Journal volume & issue: Vol. Vol. 13 no. 2, no. Graph and Algorithms

Abstract

Graphs and Algorithms

[info.info-dm] computer science [cs]/discrete mathematics [cs.dm]

Published in Discrete Mathematics & Theoretical Computer Science

ISSN: 1462-7264 (Print); 1365-8050 (Online)
Publisher: Discrete Mathematics & Theoretical Computer Science
Country of publisher: France
LCC subjects: Science: Mathematics
Website: https://dmtcs.episciences.org/

About the journal