Result Number | Material Type | Add to My Shelf Action | Record Details and Options |
---|---|---|---|
1 |
Material Type: Artigo
|
Polyhedral aspects of partial orders and comparability graphsFiorini, SamuelElectronic notes in discrete mathematics, 1999-04, Vol.2, p.171-171Elsevier B.VTexto completo disponível |
|
2 |
Material Type: Artigo
|
An NC Algorithm for the Perfect Matching Problem in Larger cycle-free GraphsLakhal, J. ; Litzler, L.Electronic notes in discrete mathematics, 1999-05, Vol.3, p.114-117Elsevier B.VTexto completo disponível |
|
3 |
Material Type: Artigo
|
Bipartite sandwiches: semide?nite relaxations for maximum bicliquePasechnik, Dmitrii V.Electronic notes in discrete mathematics, 1999-05, Vol.3, p.157-161Elsevier B.VTexto completo disponível |
|
4 |
Material Type: Artigo
|
Quickly Excluding K2,r from Planar GraphsThilikos, Dimitrios M.Electronic notes in discrete mathematics, 1999-05, Vol.3, p.189-194Elsevier B.VTexto completo disponível |
|
5 |
Material Type: Artigo
|
On i-minus-Edge-Removal-critical graphsCockayne, E.J. ; Favaron, O. ; Mynhardt, C.M.Electronic notes in discrete mathematics, 2000, Vol.5, p.64-66Elsevier B.VTexto completo disponível |
|
6 |
Material Type: Artigo
|
AutoGraphiX: An Automated System for Finding Conjectures in Graph TheoryHansen, Pierre ; Caporossi, GillesElectronic notes in discrete mathematics, 2000, Vol.5, p.158-161Elsevier B.VTexto completo disponível |
|
7 |
Material Type: Artigo
|
Coloring Planar Toeplitz GraphsEuler, ReinhardtElectronic notes in discrete mathematics, 2000-07, Vol.5, p.108-111Elsevier B.VTexto completo disponível |
|
8 |
Material Type: Artigo
|
Partition Designs with two subsets of the Hamming SpaceCanogar, RobertoElectronic notes in discrete mathematics, 2000-07, Vol.5, p.53-55Elsevier B.VTexto completo disponível |
|
9 |
Material Type: Artigo
|
“Réseaux réguliers” or regular graphsGropp, HaraldElectronic notes in discrete mathematics, 2000-07, Vol.5, p.145-148Elsevier B.VTexto completo disponível |
|
10 |
Material Type: Artigo
|
Clique-width of countable graphs: a compactness propertyCourcelle, BrunoElectronic notes in discrete mathematics, 2000-07, Vol.5, p.75-76Elsevier B.VTexto completo disponível |