default search action
Discrete Mathematics & Theoretical Computer Science, Volume 21
Volume 21, Number 1, 2019
- Ville Junnila, Tero Laihonen, Tuomo Lehtila, María Luz Puertas:
On Stronger Types of Locating-dominating Codes. - Olivier Baudon, Julien Bensmail, Tom Davot, Hervé Hocquard, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
A general decomposition theory for the 1-2-3 Conjecture and locally irregular decompositions. - Rafael T. Araújo, Eurinardo Rodrigues Costa, Sulamita Klein, Rudini Menezes Sampaio
, Uéverton S. Souza:
FPT algorithms to recognize well covered graphs. - Johann A. Makowsky, Vsevolod Rakita:
On Weakly Distinguishing Graph Polynomials. - Laurent Beaudou, Giacomo Kahn, Matthieu Rosenfeld:
Bisplit graphs satisfy the Chen-Chvátal conjecture. - Stephan Dominique Andres, Edwin Lock:
Characterising and recognising game-perfect graphs. - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
New Bounds for the Dichromatic Number of a Digraph. - Guilherme de C. M. Gomes, Carlos V. G. C. Lima, Vinícius Fernandes dos Santos:
Parameterized Complexity of Equitable Coloring. - Michaël Rao, Alexandre Talon:
The 2-domination and Roman domination numbers of grid graphs. - Ragnar Groot Koerkamp, Marieke van der Wegen:
Stable gonality is computable. - Kolja Knauer, Nicolas Nisse:
Computing metric hulls in graphs. - Alejandro Contreras-Balbuena, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Alternating Hamiltonian cycles in 2-edge-colored multigraphs. - Jesse Beisegel, Carolin Denkert, Ekkehard Köhler, Matjaz Krnc, Nevena Pivac, Robert Scheffler
On the End-Vertex Problem of Graph Searches. - Ervin Györi, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of Pℓ copies in Pk-free graphs. - Nili Guttmann-Beck, Zeev Sorek, Michal Stern:
Clustered Spanning Tree - Conditions for Feasibility. - Didier Caucal:
Cayley graphs of basic algebraic structures.
Volume 21, Number 2, 2019
- Samuel Regan, Erik Slivken:
Expected size of a tree in the fixed point forest. - Enrica Duchi:
A code for square permutations and convex permutominoes. - Ioannis Michos, Christina Savvidou:
Enumeration of super-strong Wilf equivalence classes of permutations in the generalized factor order. - Dun Qiu, Jeffrey B. Remmel:
Classical pattern distributions in Sn(132) and Sn(123). - Saúl A. Blanco
On the number of pancake stacks requiring four flips to be sorted. - Juan S. Auli, Sergi Elizalde:
Consecutive Patterns in Inversion Sequences. - Michael Albert, Jinge Li:
Uniquely-Wilf classes. - Miklós Bóna, Michael Cory:
Cyclic permutations avoiding pairs of patterns of length three. - Samuel Braunfeld
The undecidability of joint embedding and joint homomorphism for hereditary graph classes. - Murray Tannock, Michael Albert:
Prolific Compositions. - Naiomi T. Cameron, Kendra Killpatrick:
Statistics on Linear Chord Diagrams.
Volume 21, Number 3, 2019
- Hongliang Lu, Qinglin Yu:
Binding Number, Toughness and General Matching Extendability in Graphs. - Ville Junnila, Tero Laihonen, Gabrielle Paris:
Solving Two Conjectures regarding Codes for Location in Circulant Graphs. - Michael A. Henning, Elena Mohr, Dieter Rautenbach:
On the maximum number of minimum total dominating sets in forests. - Christof Löding, Christopher Spinrath:
Decision Problems for Subclasses of Rational Relations over Finite and Infinite Words. - Jorge Almeida, Ondrej Klíma:
On the insertion of n-powers. - Bernardo M. Ábrego, Silvia Fernández-Merchant, Mikio Kano, David Orden, Pablo Pérez-Lantero, Carlos Seara, Javier Tejel:
K1,3-covering red and blue points in the plane. - Danilo Korze, Aleksander Vesel:
Packing coloring of generalized Sierpinski graphs. - Sandi Klavzar, Douglas F. Rall:
Packing chromatic vertex-critical graphs. - Geoffrey Exoo, Jan Goedgebeur:
Bounds for the smallest k-chromatic graphs of given girth. - Feodor F. Dragan, Abdulhakeem Mohammed:
Slimness of graphs. - Carl Johan Casselgren, Petros A. Petrosyan:
Some results on the palette index of graphs. - Marwane Bouznif
Exact values for three domination-like problems in circular and infinite grid graphs of small height. - Matthew Drescher, Guy Louchard, Yvik Swan:
The Adaptive sampling revisited. - Christiane Frougny, Marta Pavelka, Edita Pelantová, Milena Svobodová:
On-line algorithms for multiplication and division in real and complex numeration systems. - Rodrigo I. Silveira, Bettina Speckmann, Kevin Verbeek:
Non-crossing paths with geographic constraints. - Aijun Dong, Jianliang Wu:
Equitable Coloring and Equitable Choosability of Planar Graphs without chordal 4- and 6-Cycles. - Mélodie Lapointe:
Number of orbits of Discrete Interval Exchanges. - Alexander Pilz:
Planar 3-SAT with a Clause/Variable Cycle. - Jonathan Klawitter
The agreement distance of rooted phylogenetic networks. - Konstantinos Georgiou, George Karakostas, Evangelos Kranakis:
Search-and-Fetch with 2 Robots on a Disk: Wireless and Face-to-Face Communication Models. - Marilena Barnabei, Flavio Bonetti, Niccolò Castronuovo, Matteo Silimbani:
Consecutive patterns in restricted permutations and involutions. - Arnaud Mary
Efficient enumeration of solutions produced by closure operations. - Laurent Beaudou, Richard C. Brewster:
On the multipacking number of grid graphs. - Julien Bensmail, Thibaut Blanc, Nathann Cohen, Frédéric Havet, Leonardo S. Rocha:
Backbone colouring and algorithms for TDMA scheduling.
Volume 21, Number 4, 2019
- Huazhong Lü, Tingzeng Wu
Super edge-connectivity and matching preclusion of data center networks. - Diane Castonguay, Erika M. M. Coelho, Hebert Coelho, Julliano R. Nascimento:
A note on the convexity number for complementary prisms. - Jan Goedgebeur, Carol T. Zamfirescu:
On almost hypohamiltonian graphs. - Kitty Meeks, Dominik K. Vu:
Extremal properties of flood-filling games. - Michal Tuczynski, Przemyslaw Wenus, Krzysztof Wesek:
On cordial labeling of hypertrees. - Frédéric Havet, Nicolas Nisse:
Constrained ear decompositions in graphs and digraphs. - Tianlong Ma, Yaping Mao, Eddie Cheng, Christopher Melekian:
Fractional matching preclusion for generalized augmented cubes. - Kevin Durant, Stephan G. Wagner:
On the centroid of increasing trees. - Arash Ahadi, Ali Dehghan:
(2/2/3)-SAT problem and its applications in dominating set problems. - Andrzej Dudek, Andrzej Rucinski
Monochromatic loose paths in multicolored k-uniform cliques. - Ferhat Alkan
Structure of conflict graphs in constraint alignment problems and algorithms. - Masaki Nakanishi, Abuzer Yakaryilmaz, Aida Gainutdinova:
New results on classical and quantum counter automata. - Kengo Enami
Embeddings of 3-connected 3-regular planar graphs on surfaces of non-negative Euler characteristic. - Colin Defant:
Proofs of Conjectures about Pattern-Avoiding Linear Extensions. - Audace A. V. Dossou-Olory, Stephan Wagner:
On the inducibility of small trees. - Zongwen Bai, Jianhua Tu, Yongtang Shi:
An improved algorithm for the vertex cover $P_3$ problem on graphs of bounded treewidth. - Matjaz Krnc, Tomaz Pisanski:
Generalized Petersen graphs and Kronecker covers. - Daniel J. Rosenkrantz, Madhav V. Marathe, S. S. Ravi, Richard Edwin Stearns:
Symmetry Properties of Nested Canalyzing Functions. - Paul Dorbec, Antonio González, Claire Pennarun:
Power domination in maximal planar graphs.
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-11-15 19:21 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: