Остановите войну!
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 234 matches
- 2022
- Michael Kaufmann, Torsten Ueckerdt:
The Density of Fan-Planar Graphs. Electron. J. Comb. 29(1) (2022) - Pierre Aboulker, Guillaume Aubian, Chien-Chung Huang:
Vizing's and Shannon's Theorems for Defective Edge Colouring. Electron. J. Comb. 29(4) (2022) - Pierre Aboulker, Nicolas Bousquet, Rémi de Joannis de Verclos:
Chordal Directed Graphs Are Not $\chi$-Bounded. Electron. J. Comb. 29(2) (2022) - Pierre Aboulker, Frédéric Havet, Kolja Knauer, Clément Rambaud:
On the Dichromatic Number of Surfaces. Electron. J. Comb. 29(1) (2022) - Ron Aharoni, Joseph Briggs, Minho Cho, Jinha Kim:
Cooperative Conditions for the Existence of Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - Ron Aharoni, Eli Berger, Maria Chudnovsky, Shira Zerbib:
Rainbow Paths and Large Rainbow Matchings. Electron. J. Comb. 29(1) (2022) - Shreya Ahirwar, Susanna Fishel, Parikshita Gya, Pamela E. Harris, Nguyen Pham, Andrés R. Vindas-Meléndez, Dan Khanh Vo:
Maximal Chains in Bond Lattices. Electron. J. Comb. 29(3) (2022) - Safyan Ahmad, Fazal Abbas, Shamsa Kanwal:
Cohen-Macaulay Growing Graphs. Electron. J. Comb. 29(3) (2022) - Farid Aliniaeifard, Nathaniel Thiem:
Hopf Structures in the Representation Theory of Direct Products. Electron. J. Comb. 29(4) (2022) - Imran Allie, Edita Mácajová, Martin Skoviera:
Snarks with Resistance $n$ and Flow Resistance $2n$. Electron. J. Comb. 29(1) (2022) - Lars Døvling Andersen, Stacie Baumann, Anthony J. W. Hilton, Christopher A. Rodger:
On Completing Partial Latin Squares with Prescribed Diagonals. Electron. J. Comb. 29(3) (2022) - Richard P. Anstee, N. A. Nikov:
Shattering and More: Extending the Complete Object. Electron. J. Comb. 29(2) (2022) - Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Independent Sets in Subgraphs of a Shift Graph. Electron. J. Comb. 29(1) (2022) - Andrii Arman, Vojtech Rödl, Marcelo Tadeu Sales:
Every Steiner Triple System Contains Almost Spanning $d$-Ary Hypertree. Electron. J. Comb. 29(3) (2022) - Arnbjörg Soffía Árnadóttir, Waltraud Lederle, Rögnvaldur G. Möller:
On Infinite, Cubic, Vertex-Transitive Graphs with Applications to Totally Disconnected, Locally Compact Groups. Electron. J. Comb. 29(4) (2022) - Shamil Asgarli, Sergey Goryainov, Huiqiu Lin, Chi Hoi Yip:
The EKR-Module Property of Pseudo-Paley Graphs of Square Order. Electron. J. Comb. 29(4) (2022) - Bethany Austhof, Patrick Bennett, Nick Christo:
The Set of Ratios of Derangements to Permutations in Digraphs is Dense in $[0, 1/2]$. Electron. J. Comb. 29(1) (2022) - Oliver Bachtler, Sven O. Krumke:
Towards Obtaining a 3-Decomposition From a Perfect Matching. Electron. J. Comb. 29(4) (2022) - Deepak Bal, Louis DeBiasio:
New Lower Bounds on the Size-Ramsey Number of a Path. Electron. J. Comb. 29(1) (2022) - Gill Barequet, Gil Ben-Shachar:
Minimum-Perimeter Lattice Animals and the Constant-Isomer Conjecture. Electron. J. Comb. 29(3) (2022) - Abdul Basit, Daniel McGinnis, Henry Simmons, Matt Sinnwell, Shira Zerbib:
Improved Bounds on a Generalization of Tuza's Conjecture. Electron. J. Comb. 29(4) (2022) - Wouter Cames van Batenburg:
Minimum Maximal Matchings in Cubic Graphs. Electron. J. Comb. 29(2) (2022) - Erhan Bayraktar, Suman Chakraborty:
$K_{r, s}$ Graph Bootstrap Percolation. Electron. J. Comb. 29(1) (2022) - Saman Bazarghani, Paz Carmi, Vida Dujmovic, Pat Morin:
$2\times n$ Grids have Unbounded Anagram-Free Chromatic Number. Electron. J. Comb. 29(3) (2022) - Nicholas R. Beaton:
Walks Obeying Two-Step Rules on the Square Lattice: Full, Half and Quarter Planes. Electron. J. Comb. 29(1) (2022) - Natalie C. Behague, J. Robert Johnson:
Synchronizing Times for $k$-sets in Automata. Electron. J. Comb. 29(3) (2022) - Natalie C. Behague, Trent G. Marbach, Pawel Pralat:
Tight Bounds on Probabilistic Zero Forcing on Hypercubes and Grids. Electron. J. Comb. 29(1) (2022) - Carolina Benedetti, Anastasia Chavez, Daniel Tamayo Jiménez:
Quotients of Uniform Positroids. Electron. J. Comb. 29(1) (2022) - Itai Benjamini, John Haslegrave:
Degrees in Link Graphs of Regular Graphs. Electron. J. Comb. 29(2) (2022) - Yosef Berman, Bridget Eileen Tenner:
Pattern-Functions, Statistics, and Shallow Permutations. Electron. J. Comb. 29(4) (2022)
skipping 204 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-05-21 21:43 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