Almost all graphs with 2. 522 edges are not 3-colorable.
Achlioptas, Dimitris; Molloy, Michael
The Electronic Journal of Combinatorics [electronic only] (1999)
- Volume: 6, Issue: 1, page Research paper 29, 9 p.-Research paper 29, 9 p.
- ISSN: 1077-8926
Access Full Article
top
How to cite
topAchlioptas, Dimitris, and Molloy, Michael. "Almost all graphs with 2. 522 edges are not 3-colorable.." The Electronic Journal of Combinatorics [electronic only] 6.1 (1999): Research paper 29, 9 p.-Research paper 29, 9 p.. <http://eudml.org/doc/119877>.
@article{Achlioptas1999,
author = {Achlioptas, Dimitris, Molloy, Michael},
journal = {The Electronic Journal of Combinatorics [electronic only]},
language = {eng},
number = {1},
pages = {Research paper 29, 9 p.-Research paper 29, 9 p.},
publisher = {Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos},
title = {Almost all graphs with 2. 522 edges are not 3-colorable.},
url = {http://eudml.org/doc/119877},
volume = {6},
year = {1999},
}
TY - JOUR
AU - Achlioptas, Dimitris
AU - Molloy, Michael
TI - Almost all graphs with 2. 522 edges are not 3-colorable.
JO - The Electronic Journal of Combinatorics [electronic only]
PY - 1999
PB - Prof. André Kündgen, Deptartment of Mathematics, California State University San Marcos, San Marcos
VL - 6
IS - 1
SP - Research paper 29, 9 p.
EP - Research paper 29, 9 p.
LA - eng
UR - http://eudml.org/doc/119877
ER -
NotesEmbed ?
topYou must be logged in to post comments.
To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.