Остановите войну!
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 48 matches
- 2023
- Bahareh Afshari:
Algebraic connectivity of the second power of a graph. J. Graph Theory 104(2): 275-281 (2023) - Ron Aharoni, Joseph Briggs, Jinha Kim, Minki Kim:
Rainbow independent sets in certain classes of graphs. J. Graph Theory 104(3): 557-584 (2023) - Robert E. L. Aldred, Bill Jackson, Michael D. Plummer:
Edge proximity conditions for extendability in regular bipartite graphs. J. Graph Theory 104(2): 282-288 (2023) - Jurgen Aliaj, Michael Molloy:
Adaptable and conflict colouring multigraphs with no cycles of length three or four. J. Graph Theory 104(1): 188-219 (2023) - Sylwia Antoniuk, Andrzej Dudek, Andrzej Rucinski:
Powers of Hamiltonian cycles in randomly augmented Dirac graphs - The complete collection. J. Graph Theory 104(4): 811-835 (2023) - Inon Attias, Ishay Haviv:
Local orthogonality dimension. J. Graph Theory 104(2): 387-419 (2023) - Maria Axenovich, Michael Zheng:
Interval colorings of graphs - Coordinated and unstable no-wait schedules. J. Graph Theory 104(4): 757-768 (2023) - Oliver Bachtler, Irene Heinrich:
Automated testing and interactive construction of unavoidable sets for graph classes of small path-width. J. Graph Theory 104(2): 289-319 (2023) - Iliya Bluskov, Jan de Heer, Alexander F. Sidorenko:
Turán numbers T(n,5,3) $T(n,5,3)$ and graphs without induced 5-cycles. J. Graph Theory 104(3): 451-460 (2023) - Felix Bock, Johannes Pardey, Lucia Draque Penso, Dieter Rautenbach:
Relating the independence number and the dissociation number. J. Graph Theory 104(2): 320-340 (2023) - Marthe Bonamy, Jadwiga Czyzewska, Lukasz Kowalik, Michal Pilipczuk:
Partitioning edges of a planar graph into linear forests and a matching. J. Graph Theory 104(3): 659-677 (2023) - Marthe Bonamy, Théo Pierron, Éric Sopena:
Every planar graph with Δ ${\rm{\Delta }}$ ⩾ 8 is totally (Δ+2) $({\rm{\Delta }}+2)$-choosable. J. Graph Theory 104(1): 17-86 (2023) - Calum Buchanan, Alexander Clifton, Eric Culver, Jiaxi Nie, Jason O'Neill, Puck Rombach, Mei Yin:
Odd covers of graphs. J. Graph Theory 104(2): 420-439 (2023) - Guantao Chen, Yanli Hao, Guoning Yu:
Linear arboricity of degenerate graphs. J. Graph Theory 104(2): 360-371 (2023) - Xiaolin Chen, Guangbiao Wei, Huishu Lian:
Solution to a conjecture on the mean subtree order of graphs under edge addition. J. Graph Theory 104(3): 645-658 (2023) - Eun-Kyung Cho, Ilkyoo Choi, Hyemin Kwon, Boram Park:
A tight bound for independent domination of cubic graphs without 4-cycles. J. Graph Theory 104(2): 372-386 (2023) - Maria Chudnovsky, Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number VII. Disjoint holes. J. Graph Theory 104(3): 499-515 (2023) - Konrad K. Dabrowski, Tomás Masarík, Jana Novotná, Daniël Paulusma, Pawel Rzazewski:
Clique-width: Harnessing the power of atoms. J. Graph Theory 104(4): 769-810 (2023) - Christopher Duffy, Pavan P. D, Sandeep R. B., Sagnik Sen:
On deeply critical oriented cliques. J. Graph Theory 104(1): 150-159 (2023) - Janusz Dybizbanski:
Equitable oriented coloring. J. Graph Theory 104(1): 171-187 (2023) - Victor Falgas-Ravry, Robert Hancock, Johanna Strömberg, Andrew J. Uzzell:
Rectilinear approximation and volume estimates for hereditary bodies via [0, 1]-decorated containers. J. Graph Theory 104(1): 104-132 (2023) - Dandan Fan, Xiaofeng Gu, Huiqiu Lin:
Spectral radius and edge-disjoint spanning trees. J. Graph Theory 104(4): 697-711 (2023) - Celina M. H. de Figueiredo, Alexsander Andrade de Melo, Fabiano de S. Oliveira, Ana Silva:
MaxCut on permutation graphs is NP-complete. J. Graph Theory 104(1): 5-16 (2023) - Alan M. Frieze, Wesley Pegden:
Spanners in randomly weighted graphs: Euclidean case. J. Graph Theory 104(1): 87-103 (2023) - Luyining Gan, Jie Han, Lin Sun, Guanghui Wang:
Large Yk,b ${Y}_{k,b}$-tilings and Hamilton ℓ $\ell $-cycles in k $k$-uniform hypergraphs. J. Graph Theory 104(3): 516-556 (2023) - Daniël M. H. van Gent:
Nonabelian flows in networks. J. Graph Theory 104(1): 245-256 (2023) - Mingyang Guo, Hongliang Lu, Yaolin Jiang:
Improved bound on vertex degree version of Erdős matching conjecture. J. Graph Theory 104(3): 485-498 (2023) - He Guo, Lutz Warnke:
Bounds on Ramsey games via alterations. J. Graph Theory 104(3): 470-484 (2023) - Jürgen Jost, Raffaella Mulas, Dong Zhang:
Petals and books: The largest Laplacian spectral gap from 1. J. Graph Theory 104(4): 727-756 (2023) - Vladislav Kozhevnikov, Maksim Zhukovskii:
Large cycles in generalized Johnson graphs. J. Graph Theory 104(4): 904-918 (2023)
skipping 18 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-10 18:23 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