Остановите войну!
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 44 matches
- 2018
- Ahmad Abdi, Bertrand Guenin:
Packing odd T-joins with at most two terminals. J. Graph Theory 87(4): 587-652 (2018) - Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. J. Graph Theory 87(1): 77-88 (2018) - Ron Aharoni, Eli Berger, Dani Kotlar, Ran Ziv:
Degree Conditions for Matchability in 3-Partite Hypergraphs. J. Graph Theory 87(1): 61-71 (2018) - Saieed Akbari, Amir Hossein Ghodrati, Mohammad Ali Hosseinzadeh, Ali Iranmanesh:
Equimatchable Regular Graphs. J. Graph Theory 87(1): 35-45 (2018) - Alan Arroyo, Dan McQuillan, R. Bruce Richter, Gelasio Salazar:
Levi's Lemma, pseudolinear drawings of Kn, and empty triangles. J. Graph Theory 87(4): 443-459 (2018) - Armen S. Asratian, Carl Johan Casselgren, Petros A. Petrosyan:
Some results on cyclic interval edge colorings of graphs. J. Graph Theory 87(2): 239-252 (2018) - Maria Axenovich, John L. Goldwasser, Ryan Hansen, Bernard Lidický, Ryan R. Martin, David Offner, John M. Talbot, Michael Young:
Polychromatic colorings of complete graphs with respect to 1-, 2-factors and Hamiltonian cycles. J. Graph Theory 87(4): 660-671 (2018) - Jørgen Bang-Jensen, Jing Huang, Xuding Zhu:
Completing orientations of partially oriented graphs. J. Graph Theory 87(3): 285-304 (2018) - Julien Bensmail, Ararat Harutyunyan, Ngoc-Khang Le:
List coloring digraphs. J. Graph Theory 87(4): 492-508 (2018) - Gunnar Brinkmann, Jasper Souffriau, Nico Van Cleemput:
On the number of hamiltonian cycles in triangulations with few separating triangles. J. Graph Theory 87(2): 164-175 (2018) - Henning Bruhn, Felix Joos, Oliver Schaudt:
Long cycles through prescribed vertices have the Erdős-Pósa property. J. Graph Theory 87(3): 275-284 (2018) - Kathie Cameron, Steven Chaplick, Chính T. Hoàng:
On the structure of (pan, even hole)-free graphs. J. Graph Theory 87(1): 108-129 (2018) - Hu Ye Chen, Zai Ping Lu:
Edge-transitive homogeneous factorizations of complete uniform hypergraphs. J. Graph Theory 87(3): 305-316 (2018) - Rong Chen, Geoff Whittle:
On Recognizing Frame and Lifted-Graphic Matroids. J. Graph Theory 87(1): 72-76 (2018) - Maria Chudnovsky:
A short proof of the wonderful lemma. J. Graph Theory 87(3): 271-274 (2018) - Éva Czabarka, László A. Székely, Stephan G. Wagner:
On the Number of Nonisomorphic Subtrees of a Tree. J. Graph Theory 87(1): 89-95 (2018) - Michal Debski, Zbigniew Lonc, Pawel Rzazewski:
Achromatic and Harmonious Colorings of Circulant Graphs. J. Graph Theory 87(1): 18-34 (2018) - Peter J. Dukes, Garret Flowers:
Configurations containing a given linear hypergraph. J. Graph Theory 87(3): 356-361 (2018) - Wenwen Fan, Cai Heng Li:
The complete bipartite graphs with a unique edge-transitive embedding. J. Graph Theory 87(4): 581-586 (2018) - Shinya Fujita, Ruonan Li, Shenggui Zhang:
Color degree and monochromatic degree conditions for short properly colored cycles in edge-colored graphs. J. Graph Theory 87(3): 362-373 (2018) - Serge Gaspers, Simon Mackenzie:
On the number of minimal separators in graphs. J. Graph Theory 87(4): 653-659 (2018) - Jan Goedgebeur, Oliver Schaudt:
Exhaustive generation of k-critical H-free graphs. J. Graph Theory 87(2): 188-207 (2018) - Christina Graves, Stephen J. Graves, Lindsey-Kay Lauderdale:
Smallest graphs with given generalized quaternion automorphism group. J. Graph Theory 87(4): 430-442 (2018) - Hamed Hatami, Svante Janson, Balázs Szegedy:
Graph properties, graph limits, and entropy. J. Graph Theory 87(2): 208-229 (2018) - Frédéric Havet, Ana Karolinna Maia, Bojan Mohar:
Finding a subdivision of a prescribed digraph of order 4. J. Graph Theory 87(4): 536-560 (2018) - Carlos Hoppen, Hanno Lefmann, Knut Odermann, Juliana Sanches:
Edge-colorings avoiding rainbow stars. J. Graph Theory 87(4): 399-429 (2018) - Paul Horn:
Rainbow spanning trees in complete graphs colored by one-factorizations. J. Graph Theory 87(3): 333-346 (2018) - Xinmin Hou, Yu Qiu, Boyuan Liu:
Decomposition of Graphs into (k, r)-Fans and Single Edges. J. Graph Theory 87(1): 46-60 (2018) - Zhiquan Hu, Feifei Song:
Long cycles passing through ⌊4k+13⌋ vertices in k-connected graphs. J. Graph Theory 87(3): 374-393 (2018) - Attila Joó:
Packing Countably Many Branchings with Prescribed Root-Sets in Infinite Digraphs. J. Graph Theory 87(1): 96-107 (2018)
skipping 14 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-06-01 05:49 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