Geodesic
Complexity results on graphs with few cliques
Discrete mathematics & theoretical computer science, Tome 9 (2007) no. 1.

Voir la notice de l'article provenant de la source Episciences

Graphs and Algorithms 
@article{DMTCS_2007_9_1_a5,
     author = {Rosgen, Bill and Stewart, Lorna},
     title = {Complexity results on graphs with few cliques},
     journal = {Discrete mathematics & theoretical computer science},
     publisher = {mathdoc},
     volume = {9},
     number = {1},
     year = {2007},
     doi = {10.46298/dmtcs.387},
     language = {en},
     url = {http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.387/}
}
TY  - JOUR
AU  - Rosgen, Bill
AU  - Stewart, Lorna
TI  - Complexity results on graphs with few cliques
JO  - Discrete mathematics & theoretical computer science
PY  - 2007
VL  - 9
IS  - 1
PB  - mathdoc
UR  - http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.387/
DO  - 10.46298/dmtcs.387
LA  - en
ID  - DMTCS_2007_9_1_a5
ER  - 
%0 Journal Article
%A Rosgen, Bill
%A Stewart, Lorna
%T Complexity results on graphs with few cliques
%J Discrete mathematics & theoretical computer science
%D 2007
%V 9
%N 1
%I mathdoc
%U http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.387/
%R 10.46298/dmtcs.387
%G en
%F DMTCS_2007_9_1_a5
Rosgen, Bill; Stewart, Lorna. Complexity results on graphs with few cliques. Discrete mathematics & theoretical computer science, Tome 9 (2007) no. 1. doi : 10.46298/dmtcs.387. http://geodesic.mathdoc.fr/articles/10.46298/dmtcs.387/

Cité par Sources :