Остановите войну!
for scientists:
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 29 matches
- 2021
- Jirí Fiala, Jaroslav Nesetril:
Foreword. Eur. J. Comb. 91: 103199 (2021) - Shinya Fujita, Boram Park, Tadashi Sakuma:
Stable structure on safe set problems in vertex-weighted graphs. Eur. J. Comb. 91: 103211 (2021) - József Balogh, Andrzej Dudek, Lina Li:
An analogue of the Erdős-Gallai theorem for random graphs. Eur. J. Comb. 91: 103200 (2021) - József Balogh, Gyula O. H. Katona, William Linz, Zsolt Tuza:
The domination number of the graph defined by two levels of the n-cube, II. Eur. J. Comb. 91: 103201 (2021) - Bartlomiej Bosek, Tomasz Krawczyk:
On-line partitioning of width w posets into wO(loglogw) chains. Eur. J. Comb. 91: 103202 (2021) - Angel Chavez, Daphne Der-Fen Liu, Mason Shurman:
Optimal radio-k-labelings of trees. Eur. J. Comb. 91: 103203 (2021) - Eun-Kyung Cho, Ilkyoo Choi, Boram Park:
On induced saturation for paths. Eur. J. Comb. 91: 103204 (2021) - Lech Duraj, Jakub Kozik, Dmitry A. Shabanov:
Random hypergraphs and property B. Eur. J. Comb. 91: 103205 (2021) - Zdenek Dvorák, Natasha Morrison, Jonathan A. Noel, Sergey Norin, Luke Postle:
Bounding the number of cycles in a graph in terms of its degree sequence. Eur. J. Comb. 91: 103206 (2021) - Sean English, Calum MacRury, Pawel Pralat:
Probabilistic zero forcing on random graphs. Eur. J. Comb. 91: 103207 (2021) - Dennis D. A. Epple, Jing Huang:
(k, l)-colourings and Ferrers diagram representations of cographs. Eur. J. Comb. 91: 103208 (2021) - Sen-Peng Eu, Zhicong Lin, Yuan-Hsun Lo:
Signed Euler-Mahonian identities. Eur. J. Comb. 91: 103209 (2021) - Tomás Feder, Pavol Hell, Carlos S. Subi:
Distance-two colourings of Barnette graphs. Eur. J. Comb. 91: 103210 (2021) - Hui Gao, Daqing Yang:
Packing branchings under cardinality constraints on their root sets. Eur. J. Comb. 91: 103212 (2021) - Jaroslaw Grytczuk:
From the 1-2-3 conjecture to the Riemann hypothesis. Eur. J. Comb. 91: 103213 (2021) - Jan van den Heuvel, Henry A. Kierstead:
Uniform orderings for generalized coloring numbers. Eur. J. Comb. 91: 103214 (2021) - Frantisek Kardos, Jonathan Narboni:
On the 4-color theorem for signed graphs. Eur. J. Comb. 91: 103215 (2021) - Alexandr V. Kostochka, Mina Nahvi, Douglas B. West, Dara Zirlin:
3-regular graphs are 2-reconstructible. Eur. J. Comb. 91: 103216 (2021) - Alexandr V. Kostochka, Jingwei Xu:
On 2-defective DP-colorings of sparse graphs. Eur. J. Comb. 91: 103217 (2021) - Hoang La, Mickaël Montassier, Alexandre Pinlou, Petru Valicov:
r-hued (r+1)-coloring of planar graphs with girth at least 8 for r≥9. Eur. J. Comb. 91: 103219 (2021) - Edita Mácajová, Martin Skoviera:
Superposition of snarks revisited. Eur. J. Comb. 91: 103220 (2021) - Bojan Mohar, Nathan Singer:
The last temptation of William T. Tutte. Eur. J. Comb. 91: 103221 (2021) - Reza Naserasr, Éric Sopena, Thomas Zaslavsky:
Homomorphisms of signed graphs: An update. Eur. J. Comb. 91: 103222 (2021) - Jaroslav Nesetril, Patrice Ossona de Mendez, Roman Rabinovich, Sebastian Siebertz:
Classes of graphs with low complexity: The case of classes with bounded linear rankwidth. Eur. J. Comb. 91: 103223 (2021) - Arnaud Pêcher, Annegret Katrin Wagler:
On circular-perfect graphs: A survey. Eur. J. Comb. 91: 103224 (2021) - Mirko Petrusevski, Riste Skrekovski:
Odd decompositions and coverings of graphs. Eur. J. Comb. 91: 103225 (2021) - Eckhard Steffen, Alexander Vogel:
Concepts of signed graph coloring. Eur. J. Comb. 91: 103226 (2021) - Tsai-Lien Wong:
2-connected chordal graphs and line graphs are (1, 5)-choosable. Eur. J. Comb. 91: 103227 (2021) - Junyang Zhang, Sanming Zhou:
On subgroup perfect codes in Cayley graphs. Eur. J. Comb. 91: 103228 (2021)
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-07-19 13:36 CEST 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