Остановите войну!
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 41 matches
- 2024
- Pierre Aboulker, Guillaume Aubian, Pierre Charbit:
Heroes in oriented complete multipartite graphs. J. Graph Theory 105(4): 652-669 (2024) - Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Induced subgraphs and tree decompositions V. one neighbor in a hole. J. Graph Theory 105(4): 542-561 (2024) - Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin, Shujing Wang, Anders Yeo, Yacong Zhou:
On Seymour's and Sullivan's second neighbourhood conjectures. J. Graph Theory 105(3): 413-426 (2024) - Bogdan Alecu, Vadim V. Lozin, Dmitriy S. Malyshev:
Critical properties of bipartite permutation graphs. J. Graph Theory 105(1): 34-60 (2024) - Deepak Bal, Louis DeBiasio:
Large monochromatic components in hypergraphs with large minimum codegree. J. Graph Theory 105(3): 367-372 (2024) - János Barát, András Gyárfás, Géza Tóth:
Monochromatic spanning trees and matchings in ordered complete graphs. J. Graph Theory 105(4): 523-541 (2024) - Tolson Bell, Alan M. Frieze:
Rainbow powers of a Hamilton cycle in Gn,p. J. Graph Theory 105(4): 491-500 (2024) - Thomas Böhme, Jochen Harant, Matthias Kriesell, Samuel Mohr, Jens M. Schmidt:
Rooted minors and locally spanning subgraphs. J. Graph Theory 105(2): 209-229 (2024) - Andrea C. Burgess, Robert D. Luther, David A. Pike:
The edge-connectivity of vertex-transitive hypergraphs. J. Graph Theory 105(2): 252-259 (2024) - Stijn Cambie, Guantao Chen, Yanli Hao, Nizamettin Tokar:
Decreasing the mean subtree order by adding k edges. J. Graph Theory 105(3): 357-366 (2024) - Carl Johan Casselgren:
Brooks' theorem with forbidden colors. J. Graph Theory 105(3): 373-385 (2024) - William Chan, Logan Crew:
A graph polynomial from chromatic symmetric functions. J. Graph Theory 105(4): 633-651 (2024) - Arnab Char, Thiyagarajan Karthick:
Optimal chromatic bound for ( ¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$ )-free graphs. J. Graph Theory 105(2): 149-178 (2024) - Bin Chen, An Chang:
Disjoint cycles in tournaments and bipartite tournaments. J. Graph Theory 105(2): 297-314 (2024) - Guantao Chen, Yanli Hao, Guoning Yu:
A decomposition method on solving the linear arboricity conjecture. J. Graph Theory 105(2): 315-332 (2024) - Narda Cordero-Michel, Hortensia Galeana-Sánchez:
Congruence of cycle lengths and chromatic number. J. Graph Theory 105(2): 239-251 (2024) - Daniel W. Cranston, Reem Mahmoud:
5-Coloring reconfiguration of planar graphs with no short odd cycles. J. Graph Theory 105(4): 670-679 (2024) - Tamás Csernák, Lajos Soukup:
Elusive properties of infinite graphs. J. Graph Theory 105(3): 427-450 (2024) - Hamid Reza Daneshpajouh:
On the number of star-shaped classes in optimal colorings of Kneser graphs. J. Graph Theory 105(2): 230-238 (2024) - Benjamin Dozier, Jenya Sapir:
Simple versus nonsimple loops on random regular graphs. J. Graph Theory 105(4): 562-579 (2024) - Tuvi Etzion:
Graphs with the unique path property: Structure, cycles, factors, and constructions. J. Graph Theory 105(1): 5-33 (2024) - P. Francis, Abraham M. Illickan, Lijo M. Jose, Deepak Rajendraprasad:
Disjoint total dominating sets in near-triangulations. J. Graph Theory 105(1): 68-77 (2024) - Jan Goedgebeur, Jarne Renders, Gábor Wiener, Carol T. Zamfirescu:
K2-Hamiltonian graphs: II. J. Graph Theory 105(4): 580-611 (2024) - John L. Goldwasser, Ryan Hansen:
Inducibility in the hypercube. J. Graph Theory 105(4): 501-522 (2024) - Yangyan Gu, Xuding Zhu:
The Alon-Tarsi number of planar graphs revisited. J. Graph Theory 105(3): 398-402 (2024) - Michael A. Henning, Anders Yeo:
Transversals in regular uniform hypergraphs. J. Graph Theory 105(3): 468-485 (2024) - Robert Hickingbotham, Paul Jungeblut, Laura Merker, David R. Wood:
The product structure of squaregraphs. J. Graph Theory 105(2): 179-191 (2024) - Ademir Hujdurovic, Ðorde Mitrovic:
Some conditions implying stability of graphs. J. Graph Theory 105(1): 98-109 (2024) - Tibor Jordán:
Ear-decompositions, minimally connected matroids and rigid graphs. J. Graph Theory 105(3): 451-467 (2024) - Hemanshu Kaul, Akash Kumar, Jeffrey A. Mudrock, Patrick Rewers, Paul Shin, Khue To:
On the list color function threshold. J. Graph Theory 105(3): 386-397 (2024)
skipping 11 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-12 02:30 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