![](https://dblp.uni-trier.de./img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de./img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de./img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de./img/search.dark.16x16.png)
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 42 matches
- 2023
- Maryam Abdi, Ebrahim Ghorbani:
Quartic graphs with minimum spectral gap. J. Graph Theory 102(2): 205-233 (2023) - Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh
, Meirav Zehavi:
Erdős-Pósa property of obstructions to interval graphs. J. Graph Theory 102(4): 702-727 (2023) - Hugo A. Akitaya
, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth
:
Reconfiguration of connected graph partitions. J. Graph Theory 102(1): 35-66 (2023) - Robert E. L. Aldred
, Jun Fujisawa
:
Removal of subgraphs and perfect matchings in graphs on surfaces. J. Graph Theory 102(2): 304-321 (2023) - Jørgen Bang-Jensen
, Frédéric Havet
, Anders Yeo
:
Spanning eulerian subdigraphs in semicomplete digraphs. J. Graph Theory 102(3): 578-606 (2023) - Fábio Botler
, Lucas Colucci
, Yoshiharu Kohayakawa
:
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. J. Graph Theory 102(1): 197-200 (2023) - Peter Bradshaw
, Seyyed Aliasghar Hosseini
, Bojan Mohar
, Ladislav Stacho:
On the cop number of graphs of high girth. J. Graph Theory 102(1): 15-34 (2023) - Richard C. Brewster
, Benjamin R. Moore
:
Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$. J. Graph Theory 102(2): 271-294 (2023) - Matija Bucic
, Amir Khamseh:
The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths. J. Graph Theory 102(4): 784-796 (2023) - Stijn Cambie
, Rémi de Joannis de Verclos, Ross J. Kang
:
Regular Turán numbers and some Gan-Loh-Sudakov-type problems. J. Graph Theory 102(1): 67-85 (2023) - Peter J. Cameron
, Bojan Kuzma
:
Between the enhanced power graph and the commuting graph. J. Graph Theory 102(2): 295-303 (2023) - Fan Chung, Ji Zeng:
Forest formulas of discrete Green's functions. J. Graph Theory 102(3): 556-577 (2023) - Daniel Cizma, Nati Linial:
Irreducible nonmetrizable path systems in graphs. J. Graph Theory 102(1): 5-14 (2023) - David Conlon, Mykhaylo Tyomkyn:
Ramsey numbers of trails and circuits. J. Graph Theory 102(1): 194-196 (2023) - Endre Csóka
, Tamás Hubai, László Lovász:
Locally common graphs. J. Graph Theory 102(3): 472-483 (2023) - Éva Czabarka
, Stephen J. Smith
, László A. Székely
:
Maximum diameter of 3- and 4-colorable graphs. J. Graph Theory 102(2): 262-270 (2023) - Jacob Fox, Zoe M. Himwich
, Nitya Mani:
Making an H $H$ -free graph k $k$ -colorable. J. Graph Theory 102(2): 234-261 (2023) - Jacob Fox, Yuval Wigderson
:
Minimum degree and the graph removal lemma. J. Graph Theory 102(4): 648-665 (2023) - Hui Gao, Daqing Yang
:
Digraph analogues for the Nine Dragon Tree Conjecture. J. Graph Theory 102(3): 521-534 (2023) - Carla Groenland
, Tomás Kaiser
, Oscar Treffers, Matthew Wales:
Graphs of low average degree without independent transversals. J. Graph Theory 102(2): 374-387 (2023) - Toru Hasunuma
:
Connectivity preserving trees in k-connected or k-edge-connected graphs. J. Graph Theory 102(3): 423-435 (2023) - Bofeng Huo, Qingsong Du, Ping Li, Yang Wu, Jun Yin, Hong-Jian Lai:
Supereulerian regular matroids without small cocircuits. J. Graph Theory 102(1): 107-127 (2023) - Peter Lambert-Cole
, Danielle O'Donnol:
Planar Legendrian Θ ${\rm{\Theta }}$ -graphs. J. Graph Theory 102(3): 436-457 (2023) - Michal Lason
, Malgorzata Sulkowska
:
Modularity of minor-free graphs. J. Graph Theory 102(4): 728-736 (2023) - Xia Liu, Zdenek Ryjácek
, Petr Vrána
, Liming Xiong
, Xiaojing Yang:
Hamilton-connected {claw, net}-free graphs, I. J. Graph Theory 102(1): 154-179 (2023) - Adam Logan, Michael Molloy
, Pawel Pralat
:
A variant of the Erdős-Rényi random graph process. J. Graph Theory 102(2): 322-345 (2023) - Zuwen Luo
, Kexiang Xu
, Stephan G. Wagner
, Hua Wang
:
On the mean subtree order of trees under edge contraction. J. Graph Theory 102(3): 535-551 (2023) - Riccardo W. Maffucci:
Constructing certain families of 3-polytopal graphs. J. Graph Theory 102(3): 484-501 (2023) - Max Pitz:
A note on minor antichains of uncountable graphs. J. Graph Theory 102(3): 552-555 (2023) - Michael J. Plantholt, Songling Shan
:
Edge coloring graphs with large minimum degree. J. Graph Theory 102(4): 611-632 (2023)
skipping 12 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.uni-trier.de./img/cog.dark.24x24.png)
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-07-07 05:35 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