Остановите войну!
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 27 matches
- 2005
- Peyman Afshani, Mahsa Ghandehari, Mahya Ghandehari, Hamed Hatami, Ruzbeh Tusserkani, Xuding Zhu:
Circular chromatic index of graphs of maximum degree 3. J. Graph Theory 49(4): 325-335 (2005) - Robert E. L. Aldred, Derek A. Holton, John Sheehan:
2-factors with prescribed and proscribed edges. J. Graph Theory 49(1): 48-58 (2005) - Lowell W. Beineke, Jean E. Dunbar, Marietjie Frick:
Detour-saturated graphs. J. Graph Theory 49(2): 116-134 (2005) - Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - Alastair Farrugia, Peter Mihók, R. Bruce Richter, Gabriel Semanisin:
Factorizations and characterizations of induced-hereditary and compositive properties. J. Graph Theory 49(1): 11-27 (2005) - Stefan Felsner, William T. Trotter:
Posets and planar graphs. J. Graph Theory 49(4): 273-284 (2005) - Jun Fujisawa, Kiyoshi Yoshimoto, Shenggui Zhang:
Heavy cycles passing through some specified vertices in weighted graphs. J. Graph Theory 49(2): 93-103 (2005) - András Gyárfás, Alice Hubenko:
Semistrong edge coloring of graphs. J. Graph Theory 49(1): 39-47 (2005) - Michael A. Henning:
A linear Vizing-like relation relating the size and total domination number of a graph. J. Graph Theory 49(4): 285-290 (2005) - Jozef Jirásek:
Arc reversal in nonhamiltonian circulant oriented graphs. J. Graph Theory 49(1): 59-68 (2005) - Sandi Klavzar, Iztok Peterin:
Characterizing subgraphs of Hamming graphs. J. Graph Theory 49(4): 302-312 (2005) - Péter Komjáth, Saharon Shelah:
Finite subgraphs of uncountably chromatic graphs. J. Graph Theory 49(1): 28-38 (2005) - Daniel Král, Jirí Sgall:
Coloring graphs from lists with bounded size of their union. J. Graph Theory 49(3): 177-186 (2005) - Daniela Kühn, Deryk Osthus:
Spanning triangulations in graphs. J. Graph Theory 49(3): 205-233 (2005) - Hong-Jian Lai, Xiangwen Li, Hoifung Poon:
Nowhere zero 4-flow in regular matroids. J. Graph Theory 49(3): 196-204 (2005) - Mei Lu, Huiqing Liu, Feng Tian:
Two sufficient conditions for dominating cycles. J. Graph Theory 49(2): 135-150 (2005) - Rong Luo, Cun-Quan Zhang:
Edge-face chromatic number and edge chromatic number of simple plane graphs. J. Graph Theory 49(3): 234-256 (2005) - Dániel Marx:
NP-completeness of list coloring and precoloring extension on the edges of planar graphs. J. Graph Theory 49(4): 313-324 (2005) - Andrew McLennan:
The Erdös-Sós Conjecture for trees of diameter four. J. Graph Theory 49(4): 291-301 (2005) - Keith E. Mellinger, Dhruv Mubayi:
Constructions of bipartite graphs from finite geometries. J. Graph Theory 49(1): 1-10 (2005) - Frédéric Meunier:
A topological lower bound for the circular chromatic number of Schrijver graphs. J. Graph Theory 49(4): 257-261 (2005) - Jaroslav Nesetril, Nicholas C. Wormald:
The acyclic edge chromatic number of a random d-regular graph is d + 1. J. Graph Theory 49(1): 69-74 (2005) - Vladimir Nikiforov, Cecil C. Rousseau:
A note on Ramsey numbers for books. J. Graph Theory 49(2): 168-176 (2005) - Florian Pfender:
Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory 49(4): 262-272 (2005) - Benny Sudakov, Tibor Szabó, Van H. Vu:
A generalization of Turán's theorem. J. Graph Theory 49(3): 187-195 (2005) - Jacques Verstraëte:
Unavoidable cycle lengths in graphs. J. Graph Theory 49(2): 151-167 (2005) - Liming Xiong, Zdenek Ryjácek, Hajo Broersma:
On stability of the hamiltonian index under contractions and closures. J. Graph Theory 49(2): 104-115 (2005)
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-24 07:00 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