![](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 56 matches
- 1994
- H. L. Abbott, Bing Zhou, Donovan R. Hare:
Sparse color-critical graphs and hypergraphs with no short cycles. J. Graph Theory 18(4): 373-388 (1994) - Yousef Alavi, Jiuqiang Liu, Jianfang Wang:
On linear vertex-arboricity of complementary graphs. J. Graph Theory 18(3): 315-322 (1994) - Noga Alon:
Subdivided graphs have linear ramsey numbers. J. Graph Theory 18(4): 343-347 (1994) - Dan Archdeacon:
Self-dual embeddings of complete multipartite graphs. J. Graph Theory 18(7): 735-749 (1994) - Hans-Jürgen Bandelt, Henry Martyn Mulder
, Elke Wilkeit:
Quasi-median graphs and algebras. J. Graph Theory 18(7): 681-703 (1994) - Douglas Bauer, Edward F. Schmeichel:
Toughness, minimum degree, and the existence of 2-factors. J. Graph Theory 18(3): 241-256 (1994) - Edward A. Bertram, Paul Erdös, Peter Horák, Jozef Sirán, Zsolt Tuza:
Local and global average degree in graphs and multigraphs. J. Graph Theory 18(7): 647-661 (1994) - Arie Bialostocki, P. Dierker:
On zero sum Ramsey numbers: Multiple copies of a graph. J. Graph Theory 18(2): 143-151 (1994) - Mostafa Blidia, Pierre Duchet, Frédéric Maffray:
On the orientation of meyniel graphs. J. Graph Theory 18(7): 705-711 (1994) - Guantao Chen, Ronald J. Gould, Michael S. Jacobson, Richard H. Schelp:
Neighborhood unions and the cycle cover number of a graph. J. Graph Theory 18(7): 663-672 (1994) - Guantao Chen, Richard H. Schelp:
Hamiltonian graphs with neighborhood intersections. J. Graph Theory 18(5): 497-513 (1994) - Gregory L. Cherlin, Péter Komjáth:
There is no universal countable pentagon-free graph. J. Graph Theory 18(4): 337-341 (1994) - R. A. Clapsadle, Richard H. Schelp:
Local edge colorings that are global. J. Graph Theory 18(4): 389-399 (1994) - Stephen J. Curran:
Disjoint circuits in the cartesian product of two directed cycles. J. Graph Theory 18(2): 211-216 (1994) - Madhav P. Desai, Vasant B. Rao:
A characterization of the smallest eigenvalue of a graph. J. Graph Theory 18(2): 181-194 (1994) - Keith Edwards, Colin McDiarmid:
New upper bounds on harmonious colorings. J. Graph Theory 18(3): 257-267 (1994) - Anthony B. Evans, Gerd Fricke, Carl C. Maneri, Terry A. McKee, Manley Perkel:
Representations of graphs modulo n. J. Graph Theory 18(8): 801-815 (1994) - Genghua Fan:
Short cycle covers of cubic graphs. J. Graph Theory 18(2): 131-141 (1994) - Odile Favaron, David P. Sumner, Ewa Wojcicka:
The diameter of domination k-critical graphs. J. Graph Theory 18(7): 723-734 (1994) - Art Stephen Finbow
, Bert L. Hartnell, Richard J. Nowakowski
:
A characterization of well-covered graphs that contain neither 4- nor 5-cycles. J. Graph Theory 18(7): 713-721 (1994) - Herbert Fleischner:
Uniqueness of maximal dominating cycles in 3-regular graphs and of hamiltonian cycles in 4-regular graphs. J. Graph Theory 18(5): 449-459 (1994) - Shinsaku Fujita:
Unit subduced cycle indices for combinatorial enumeration. J. Graph Theory 18(4): 349-371 (1994) - John G. Gimbel, K. B. Reid:
Independent edges in bipartite graphs obtained from orientations of graphs. J. Graph Theory 18(5): 515-533 (1994) - Ronald J. Gould, Xingxing Yu:
On hamiltonian-connected graphs. J. Graph Theory 18(8): 841-860 (1994) - Yubao Guo, Lutz Volkmann:
Connectivity properties of locally semicomplete digraphs. J. Graph Theory 18(3): 269-280 (1994) - Denis Hanson, Ping Wang, Gary MacGillivray:
A note on minimum graphs with girth pair (4, 2l + 1). J. Graph Theory 18(4): 325-327 (1994) - Irith Ben-Arroyo Hartman, Fathi Saleh, Daniel Hershkowitz:
On greene's theorem for digraphs. J. Graph Theory 18(2): 169-175 (1994) - Andreas Huck, Frank Niedermeyer, Saharon Shelah
:
Large k-preserving sets in infinite graphs. J. Graph Theory 18(4): 413-426 (1994) - Leif K. Jørgensen:
Contractions to k8. J. Graph Theory 18(5): 431-448 (1994) - Henry A. Kierstead, Stephen G. Penrice:
Radius two trees specify χ-bounded classes. J. Graph Theory 18(2): 119-129 (1994)
skipping 26 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-22 08:20 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