Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Geodesic
Parcourir par
Revues
Séminaires
Livres
Congrès
Sources
Discrete mathematics & theoretical computer science
Tome 21 (2019)
no. 1
Précédent
Suivant
ICGT 2018
Sommaire
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions
Baudon, Olivier
;
Bensmail, Julien
;
Davot, Tom
;
Hocquard, Hervé
;
Przybyło, Jakub
;
Senhaji, Mohammed
;
Sopena, Eric
;
Woźniak, Mariusz
On Weakly Distinguishing Graph Polynomials
Makowsky, Johann A.
;
Rakita, Vsevolod
FPT algorithms to recognize well covered graphs
Araujo, Rafael
;
Costa, Eurinardo
;
Klein, Sulamita
;
Sampaio, Rudini
;
Souza, Ueverton S.
On Stronger Types of Locating-dominating Codes
Junnila, Ville
;
Laihonen, Tero
;
Lehtilä, Tuomo
;
Puertas, María Luz
Parameterized Complexity of Equitable Coloring
Gomes, Guilherme de C. M.
;
Lima, Carlos V. G. C.
;
Santos, Vinícius F. dos
The 2-domination and Roman domination numbers of grid graphs
Rao, Michaël
;
Talon, Alexandre
Characterising and recognising game-perfect graphs
Andres, Dominique
;
Lock, Edwin
Computing metric hulls in graphs
Knauer, Kolja
;
Nisse, Nicolas
New Bounds for the Dichromatic Number of a Digraph
Cordero-Michel, Narda
;
Galeana-Sánchez, Hortensia
Bisplit graphs satisfy the Chen-Chv\'atal conjecture
Beaudou, Laurent
;
Kahn, Giacomo
;
Rosenfeld, Matthieu
Stable gonality is computable
Koerkamp, Ragnar Groot
;
van der Wegen, Marieke
Alternating Hamiltonian cycles in
$2$
-edge-colored multigraphs
Contreras-Balbuena, Alejandro
;
Galeana-Sánchez, Hortensia
;
Goldfeder, Ilan A.
On the End-Vertex Problem of Graph Searches
Beisegel, Jesse
;
Denkert, Carolin
;
Köhler, Ekkehard
;
Krnc, Matjaž
;
Pivač, Nevena
;
Scheffler, Robert
;
Strehler, Martin
The maximum number of
$P_\ell$
copies in
$P_k$
-free graphs
Győri, Ervin
;
Salia, Nika
;
Tompkins, Casey
;
Zamora, Oscar
Clustered Spanning Tree - Conditions for Feasibility
Guttmann-Beck, Nili
;
Sorek, Zeev
;
Stern, Michal
Cayley graphs of basic algebraic structures
Caucal, Didier