An expected polynomial time algorithm for coloring 2-colorable 3-graphs
Graphs and Algorithms
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Discrete Mathematics & Theoretical Computer Science
2011-05-01
|
| Series: | Discrete Mathematics & Theoretical Computer Science |
| Subjects: | |
| Online Access: | https://dmtcs.episciences.org/558/pdf |
| _version_ | 1797270137848463360 |
|---|---|
| author | Yury Person Mathias Schacht |
| author_facet | Yury Person Mathias Schacht |
| author_sort | Yury Person |
| collection | DOAJ |
| description | Graphs and Algorithms |
| first_indexed | 2024-04-25T01:59:30Z |
| format | Article |
| id | doaj.art-56debc5727834dec846c2c188e39fff2 |
| institution | Directory Open Access Journal |
| issn | 1365-8050 |
| language | English |
| last_indexed | 2024-04-25T01:59:30Z |
| publishDate | 2011-05-01 |
| publisher | Discrete Mathematics & Theoretical Computer Science |
| record_format | Article |
| series | Discrete Mathematics & Theoretical Computer Science |
| spelling | doaj.art-56debc5727834dec846c2c188e39fff22024-03-07T15:19:13ZengDiscrete Mathematics & Theoretical Computer ScienceDiscrete Mathematics & Theoretical Computer Science1365-80502011-05-01Vol. 13 no. 2Graph and Algorithms10.46298/dmtcs.558558An expected polynomial time algorithm for coloring 2-colorable 3-graphsYury Person0https://orcid.org/0000-0002-3091-3025Mathias Schacht1https://orcid.org/0000-0003-1762-4090Institut für Mathematik [Berlin]Fachbereich Mathematik [Hamburg]Graphs and Algorithmshttps://dmtcs.episciences.org/558/pdf[info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| spellingShingle | Yury Person Mathias Schacht An expected polynomial time algorithm for coloring 2-colorable 3-graphs Discrete Mathematics & Theoretical Computer Science [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| title | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
| title_full | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
| title_fullStr | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
| title_full_unstemmed | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
| title_short | An expected polynomial time algorithm for coloring 2-colorable 3-graphs |
| title_sort | expected polynomial time algorithm for coloring 2 colorable 3 graphs |
| topic | [info.info-dm] computer science [cs]/discrete mathematics [cs.dm] |
| url | https://dmtcs.episciences.org/558/pdf |
| work_keys_str_mv | AT yuryperson anexpectedpolynomialtimealgorithmforcoloring2colorable3graphs AT mathiasschacht anexpectedpolynomialtimealgorithmforcoloring2colorable3graphs AT yuryperson expectedpolynomialtimealgorithmforcoloring2colorable3graphs AT mathiasschacht expectedpolynomialtimealgorithmforcoloring2colorable3graphs |