![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 35 matches
- 1997
- Alexander A. Ageev
, Alexandr V. Kostochka, Zoltán Szigeti:
A characterization of Seymour graphs. J. Graph Theory 24(4): 357-364 (1997) - Christos A. Athanasiadis:
Iterating the branching operation on a directed graph. J. Graph Theory 24(3): 257-265 (1997) - Stephan Brandt, Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Linda M. Lesniak:
Degree conditions for 2-factors. J. Graph Theory 24(2): 165-173 (1997) - Guantao Chen, Richard H. Schelp, Lubomír Soltés:
Special monochromatic trees in two-colored complete graphs. J. Graph Theory 24(1): 59-67 (1997) - Guantao Chen, Richard H. Schelp, Lubomír Soltés:
Graphs with given odd sets. J. Graph Theory 24(1): 69-80 (1997) - Gregory L. Cherlin, Niandong Shi:
Graphs omitting sums of complete graphs. J. Graph Theory 24(3): 237-247 (1997) - K. H. Chew:
An extension of Vizing's theorem. J. Graph Theory 24(4): 347-355 (1997) - Lenore Cowen, Wayne Goddard, C. Esther Jesurum:
Defective coloring revisited. J. Graph Theory 24(3): 205-219 (1997) - Tomás Dvorák
, Ivan Havel, Jean-Marie Laborde, Michel Mollard:
Spanning caterpillars of a hypercube. J. Graph Theory 24(1): 9-19 (1997) - Saad I. El-Zanati, Michael Plantholt, Shailesh K. Tipnis:
Extensions of some factorization results from simple graphs to multigraphs. J. Graph Theory 24(4): 291-295 (1997) - Hikoe Enomoto, Kazuhide Hirohata, Katsuhiro Ota:
Long cycles passing through a specified edge in a 3-connected graph. J. Graph Theory 24(3): 275-279 (1997) - Hikoe Enomoto, Shinsuke Matsunaga:
Graph decompositions without isolated vertices III. J. Graph Theory 24(2): 155-164 (1997) - Roger C. Entringer, Wayne Goddard, Michael A. Henning:
A note on cliques and independent sets. J. Graph Theory 24(1): 21-23 (1997) - Odile Favaron, Christina M. Mynhardt:
On equality in an upper bound for domination parameters of graphs. J. Graph Theory 24(3): 221-231 (1997) - Carsten Flotow:
Graphs whose powers are chordal and graphs whose powers are interval graphs. J. Graph Theory 24(4): 323-330 (1997) - Hung-Lin Fu, Kuo-Ching Huang, Christopher A. Rodger:
Connectivity of cages. J. Graph Theory 24(2): 187-191 (1997) - S. Louis Hakimi:
Graphs with given odd sets and the least number of vertices. J. Graph Theory 24(1): 81-83 (1997) - Stefan Hougardy, Van Bang Le, Annegret Wagler:
Wing-triangulated graphs are perfect. J. Graph Theory 24(1): 25-31 (1997) - Jeong Han Kim, Prasad Tetali, Peter C. Fishburn:
Score certificates for tournaments. J. Graph Theory 24(2): 117-138 (1997) - Martin Knor, Jozef Sirán:
Extremal graphs of diameter two and given maximum degree, embeddable in a fixed surface. J. Graph Theory 24(1): 1-8 (1997) - Alexandr V. Kostochka, Éric Sopena, Xuding Zhu:
Acyclic and oriented chromatic numbers of graphs. J. Graph Theory 24(4): 331-340 (1997) - Stephen Mellendorf:
Hamilton decompositions of cartesian products of multicycles. J. Graph Theory 24(1): 85-115 (1997) - Bojan Mohar:
On the minimal genus of 2-complexes. J. Graph Theory 24(3): 281-290 (1997) - David Moser:
The star-chromatic number of planar graphs. J. Graph Theory 24(1): 33-43 (1997) - Lenhard L. Ng, Michelle Schultz:
k-ordered Hamiltonian graphs. J. Graph Theory 24(1): 45-57 (1997) - Jennifer J. Quinn, Arthur T. Benjamin:
Strong chromatic index of subset graphs. J. Graph Theory 24(3): 267-273 (1997) - Vojtech Rödl, Beata Wysocka:
Note on regular subgraphs. J. Graph Theory 24(2): 139-154 (1997) - Gert Sabidussi:
Parity equivalence in eulerian graphs. J. Graph Theory 24(3): 249-256 (1997) - Daniel P. Sanders:
On paths in planar graphs. J. Graph Theory 24(4): 341-345 (1997) - Richard H. Schelp:
Local and mean k-Ramsey numbers for complete graphs. J. Graph Theory 24(3): 201-203 (1997)
skipping 5 more matches
loading more results
failed to load more results, please try again later
![](https://dblp1.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-09-04 22:37 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