Остановите войну!
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 34 matches
- 2019
- Saieed Akbari, Morteza Hasanvand, Kenta Ozeki:
Highly edge-connected factors using given lists on degrees. J. Graph Theory 90(2): 150-159 (2019) - Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Pairs and triples of forbidden subgraphs and the existence of a 2-factor. J. Graph Theory 90(1): 61-82 (2019) - M. Amin Bahmanian:
Extending edge-colorings of complete hypergraphs into regular colorings. J. Graph Theory 90(4): 547-560 (2019) - Florian Barbero, Christophe Paul, Michal Pilipczuk:
Strong immersion is a well-quasi-ordering for semicomplete digraphs. J. Graph Theory 90(4): 484-496 (2019) - Wiebke Bedenknecht, Guilherme Oliveira Mota, Christian Reiher, Mathias Schacht:
On the local density problem for graphs of given odd-girth. J. Graph Theory 90(2): 137-149 (2019) - Valerio Boncompagni, Marko Radovanovic, Kristina Vuskovic:
The structure of (theta, pyramid, 1-wheel, 3-wheel)-free graphs. J. Graph Theory 90(4): 591-628 (2019) - Maria Chudnovsky, Vaidy Sivaraman:
Perfect divisibility and 2-divisibility. J. Graph Theory 90(1): 54-60 (2019) - Éva Czabarka, László A. Székely, Stephan G. Wagner:
A tanglegram Kuratowski theorem. J. Graph Theory 90(2): 111-122 (2019) - Michal Debski:
Strong chromatic index of unit distance graphs. J. Graph Theory 90(4): 523-534 (2019) - Tomás Dvorák, Jirí Fink:
Gray codes extending quadratic matchings. J. Graph Theory 90(2): 123-136 (2019) - Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Triangle-free planar graphs with the smallest independence number. J. Graph Theory 90(3): 443-454 (2019) - Mark N. Ellingham, Emily Abernethy Marshall, Kenta Ozeki, Shoichi Tsuchiya:
Hamiltonicity of planar graphs with a forbidden minor. J. Graph Theory 90(4): 459-483 (2019) - Beka Ergemlidze, Abhishek Methuku, Nika Salia, Ervin Györi:
A note on the maximum number of triangles in a C5-free graph. J. Graph Theory 90(3): 227-230 (2019) - Hortensia Galeana-Sánchez, César Hernández-Cruz:
A dichotomy for the kernel by H-walks problem in digraphs. J. Graph Theory 90(3): 213-226 (2019) - Jinghua He, Erling Wei, Dong Ye, Shaohui Zhai:
On perfect matchings in matching covered graphs. J. Graph Theory 90(4): 535-546 (2019) - Jan Hladký, Ping Hu, Diana Piguet:
Komlós's tiling theorem via graphon covers. J. Graph Theory 90(1): 24-45 (2019) - Ramin Javadi, Sepehr Hajebi:
Edge clique cover of claw-free graphs. J. Graph Theory 90(3): 311-405 (2019) - Nishad Kothari:
Generating near-bipartite bricks. J. Graph Theory 90(4): 565-590 (2019) - Ngoc-Khang Le:
Detecting an induced subdivision of K4. J. Graph Theory 90(2): 160-171 (2019) - Min Jung Lee, Sungjong No, Seungsang Oh:
Arc index of spatial graphs. J. Graph Theory 90(3): 406-415 (2019) - Shoham Letzter, Richard Snyder:
The homomorphism threshold of -free graphs. J. Graph Theory 90(1): 83-106 (2019) - Tong Li, Zi-Xia Song, Guanghui Wang, Donglei Yang, Cun-Quan Zhang:
Antimagic orientations of even regular graphs. J. Graph Theory 90(1): 46-53 (2019) - Allan Lo:
Long properly coloured cycles in edge-coloured graphs. J. Graph Theory 90(3): 416-442 (2019) - Borut Luzar, Martina Mockovciaková, Roman Soták:
Note on list star edge-coloring of subcubic graphs. J. Graph Theory 90(3): 304-310 (2019) - Jie Ma, Tianchi Yang:
Decomposing C4-free graphs under degree constraints. J. Graph Theory 90(1): 13-23 (2019) - Martin Merker, Luke Postle:
Bounded diameter arboricity. J. Graph Theory 90(4): 629-641 (2019) - Arès Méroueh:
The Ramsey number of loose cycles versus cliques. J. Graph Theory 90(2): 172-188 (2019) - Atsuhiro Nakamoto, Kenta Noguchi, Kenta Ozeki:
Spanning bipartite quadrangulations of even triangulations. J. Graph Theory 90(3): 267-287 (2019) - Alex Scott, Paul D. Seymour, David R. Wood:
Bad news for chordal partitions. J. Graph Theory 90(1): 5-12 (2019) - Hannah Spinoza, Douglas B. West:
Reconstruction from the deck of -vertex induced subgraphs. J. Graph Theory 90(4): 497-522 (2019)
skipping 4 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-08-07 12:40 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