default search action
Search dblp
Full-text search
- > Home
Please enter a search query
- case-insensitive prefix search: default
e.g., sig matches "SIGIR" as well as "signal" - exact word search: append dollar sign ($) to word
e.g., graph$ matches "graph", but not "graphics" - boolean and: separate words by space
e.g., codd model - boolean or: connect words by pipe symbol (|)
e.g., graph|network
Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.
Author search results
no matches
Venue search results
no matches
Refine list
refine by author
- no options
- temporarily not available
refine by venue
- no options
- temporarily not available
refine by type
- no options
- temporarily not available
refine by access
- no options
- temporarily not available
refine by year
- no options
- temporarily not available
Publication search results
found 16,490 matches
- 2025
- Tara Abrishami, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl:
Induced subgraphs and tree decompositions VI. Graphs with 2-cutsets. Discret. Math. 348(1): 114195 (2025) - Fatima Akinola, Michael W. Schroeder:
On cyclic symmetric Hamilton cycle decompositions of complete multipartite graphs. Discret. Math. 348(2): 114277 (2025) - Kengo Aoki:
Improved 2-distance coloring of planar graphs with maximum degree 5. Discret. Math. 348(1): 114225 (2025) - Jean-Luc Baril, José Luis Ramírez:
Fibonacci and Catalan paths in a wall. Discret. Math. 348(2): 114268 (2025) - Angelot Behajaina, Elad Paran:
The Collatz map analogue in polynomial rings and in completions. Discret. Math. 348(2): 114273 (2025) - Evgeny Bespalov, Denis S. Krotov:
On extended 1-perfect bitrades. Discret. Math. 348(1): 114222 (2025) - Anuj Kumar Bhagat, Ritumoni Sarma, Vidya Sagar:
Subfield codes of C-codes over F2[x]/〈x3-x〉. Discret. Math. 348(1): 114223 (2025) - Therese Biedl, John Wittnebel:
Large matchings in maximal 1-planar graphs. Discret. Math. 348(2): 114288 (2025) - Aryan Bora, Yunseo Choi, Lucas Tang:
On the spum and sum-diameter of paths. Discret. Math. 348(2): 114257 (2025) - Oleg V. Borodin, Anna O. Ivanova:
Light 3-faces in 3-polytopes without adjacent triangles. Discret. Math. 348(2): 114299 (2025) - Prosenjit Bose, Jean-Lou De Carufel, Thomas C. Shermer:
Pursuit-evasion in graphs: Zombies, lazy zombies and a survivor. Discret. Math. 348(1): 114220 (2025) - Csilla Bujtás, Akbar Davoodi, Laihao Ding, Ervin Györi, Zsolt Tuza, Donglei Yang:
Covering the edges of a graph with triangles. Discret. Math. 348(1): 114226 (2025) - Ben Cameron, Aysu Gündogan, Joe Sawada:
Cut-down de Bruijn sequences. Discret. Math. 348(1): 114204 (2025) - Chiara Cappello, Reza Naserasr, Eckhard Steffen, Zhouningxin Wang:
Critically 3-frustrated signed graphs. Discret. Math. 348(2): 114258 (2025) - Michael Cary:
A note proving the nullity of block graphs is unbounded. Discret. Math. 348(2): 114289 (2025) - Sutanoya Chakraborty, Arijit Ghosh, Soumi Nandi:
Stabbing boxes with finitely many axis-parallel lines and flats. Discret. Math. 348(2): 114269 (2025) - Xun Chen, Qizhong Lin, Lin Niu:
Star-critical Ramsey numbers involving large books. Discret. Math. 348(1): 114270 (2025) - Jeremy Chizewer, Ian M. J. McInnis, Mehrdad Sohrabi, Shriya Kaistha:
The hat guessing game on cactus graphs and cycles. Discret. Math. 348(2): 114272 (2025) - Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park:
Brooks-type theorems for relaxations of square colorings. Discret. Math. 348(1): 114233 (2025) - Myungho Choi, Hojin Chu, Suh-Ryung Kim:
A digraph version of the Friendship Theorem. Discret. Math. 348(1): 114238 (2025) - Daniel W. Cranston, Reem Mahmoud:
Equitable coloring in 1-planar graphs. Discret. Math. 348(2): 114286 (2025) - François Dross, Claire Hilaire, Ivo Koch, Valeria Leoni, Nina Pardal, Maria Inés Lopez Pujato, Vinícius Fernandes dos Santos:
On the proper interval completion problem within some chordal subclasses. Discret. Math. 348(1): 114274 (2025) - Freddy Flores Dubó, Maya Stein:
On the Ramsey number of the double star. Discret. Math. 348(1): 114227 (2025) - Ronan Egan:
A survey of complex generalized weighing matrices and a construction of quantum error-correcting codes. Discret. Math. 348(1): 114201 (2025) - Austin Eide, Pawel Pralat:
Linear colouring of binomial random graphs. Discret. Math. 348(2): 114278 (2025) - István Estélyi, Ján Karabás, Alexander D. Mednykh, Roman Nedela:
The Jacobian of a graph and graph automorphisms. Discret. Math. 348(2): 114259 (2025) - Jin-Hui Fang, Ying Cheng:
On the restricted order of asymptotic bases. Discret. Math. 348(2): 114260 (2025) - Blas Fernández, Roghayeh Maleki, Stefko Miklavic, Giusy Monzillo:
Distance-regular graphs with classical parameters that support a uniform structure: Case q ≥ 2. Discret. Math. 348(2): 114263 (2025) - Giuseppe Filippone, Mario Galici:
On the number of small Steiner triple systems with Veblen points. Discret. Math. 348(2): 114294 (2025) - Dániel Gerbner:
Degree powers and number of stars in graphs with a forbidden broom. Discret. Math. 348(1): 114232 (2025)
skipping 16,460 more matches
loading more results
failed to load more results, please try again later
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.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from , , and to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
retrieved on 2024-11-12 03:39 CET from data curated by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint