Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics & Theoretical Computer Science, Volume 24
Volume 24, Number 1, 2022
- Rémy Belmonte, Michael Lampis, Valia Mitsou:
Defective Coloring on Classes of Perfect Graphs. - Nicolas Ollinger, Guillaume Theyssier:
Freezing, Bounded-Change and Convergent Cellular Automata. - Isolde Adler, Noleen Köhler
:
An explicit construction of graphs of bounded degree that are far from being Hamiltonian. - Toufik Mansour, Mark Shattuck:
Further enumeration results concerning a recent equivalence of restricted inversion sequences. - Márcia R. Cappelle, Erika M. M. Coelho, Les R. Foulds, Humberto J. Longo:
Open-independent, open-locating-dominating sets: structural aspects of some classes of graphs. - Meike Hatzel, Pawel Komosa, Marcin Pilipczuk, Manuel Sorge:
Constant Congestion Brambles. - Anna M. Brandenberger, Luc Devroye, Marcel K. Goh, Rosie Zhao:
Leaf multiplicity in a Bienaymé-Galton-Watson tree. - Wenjie Fang:
Efficient recurrence for the enumeration of permutations with fixed pinnacle set. - Ruy Fabila Monroy, Jesús Leaños, Ana Laura Trujillo-Negrete:
On the Connectivity of Token Graphs of Trees. - Angsuman Das, Hiranya Kishore Dey:
Determining Number of Kneser Graphs: Exact Values and Improved Bounds. - Daniel Birmajer, Juan B. Gil, David S. Kenepp, Michael D. Weiner:
Restricted generating trees for weak orderings. - Lukasz Bozyk, Michal Pilipczuk:
On the Erdős-Pósa property for immersions and topological minors in tournaments. - Kenjiro Takazawa:
Notes on Equitable Partitions into Matching Forests in Mixed Graphs and into $b$-branchings in Digraphs. - Jesús Leaños, Christophe Ndjatchi, Luis Manuel Ríos-Castro:
On the connectivity of the disjointness graph of segments of point sets in general position in the plane. - Jesse Racicot, Giovanni Rosso:
Domination in Knödel Graphs. - Andrei Asinowski, Benjamin Hackl, Sarah J. Selkirk:
Down-step statistics in generalized Dyck paths. - Prosenjit Bose, Vida Dujmovic, Mehrnoosh Javarsineh, Pat Morin, David R. Wood:
Separating layered treewidth and row treewidth. - Helena Bergold, Winfried Hochstättler, Uwe Mayer:
The Neighborhood Polynomial of Chordal Graphs. - Jovana Forcan, Mirjana Mikalacki:
Maker-Breaker total domination game on cubic graphs. - Julien Baste, Stefan Ehard, Dieter Rautenbach:
Non-monotone target sets for threshold values restricted to $0$, $1$, and the vertex degree. - Sulin Song, Lan Lei, Yehong Shao, Hong-Jian Lai:
Asymptotically sharpening the $s$-Hamiltonian index bound. - Sittipong Thamrongpairoj, Jeffrey B. Remmel:
Positional Marked Patterns in Permutations. - Marthe Bonamy, Lukasz Bozyk, Andrzej Grzesik, Meike Hatzel, Tomás Masarík, Jana Novotná, Karolina Okrasa:
Tuza's Conjecture for Threshold Graphs. - Michel Rigo, Manon Stipulanti:
Automatic sequences: from rational bases to trees.
Volume 24, Number 2, 2022
- Manuel Lafond, Ben Seamone, Rezvan Sherkati:
Further results on Hendry's Conjecture. - Tiziana Calamoneri, Angelo Monti, Blerina Sinaimeri:
On the domination number of $t$-constrained de Bruijn graphs. - Mitre Costa Dourado, Vitor S. Ponciano, Rômulo L. O. da Silva:
On the monophonic rank of a graph. - Richard C. Brewster, Arnott Kidner, Gary MacGillivray:
The 2-colouring problem for (m,n)-mixed graphs with switching is polynomial. - Marc Distel, Robert Hickingbotham, Tony Huynh, David R. Wood:
Improved product structure for graphs on surfaces. - Khaled M. Elbassioni:
On Dualization over Distributive Lattices. - Yen Hung Chen:
Approximability results for the $p$-centdian and the converse centdian problems. - Ahmad Biniaz, Kshitij Jain, Anna Lubiw, Zuzana Masárová, Tillmann Miltzow, Debajyoti Mondal, Anurag Murty Naredla, Josef Tkadlec, Alexi Turcotte:
Token Swapping on Trees. - Peter Dankelmann, Sonwabile Mafunda, Sufiyan Mallu:
Proximity, remoteness and maximum degree in graphs. - Luciano Margara:
A heuristic technique for decomposing multisets of non-negative integers according to the Minkowski sum. - Paul Levrie, John Campbell:
Series acceleration formulas obtained from experimentally discovered hypergeometric recursions.
a service of 
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-07-21 21:57 CEST 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:
