Остановите войну!
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 44 matches
- 2004
- Chandrashekar Adiga, H. N. Ramaswamy, D. D. Somashekara:
A note on strongly multiplicative graphs. Discuss. Math. Graph Theory 24(1): 81-83 (2004) - Gábor Bacsó, Zsolt Tuza:
Graphs without induced P5 and C5. Discuss. Math. Graph Theory 24(3): 503-507 (2004) - Bommanahal Basavanagoud, V. R. Kulli:
Characterizations of planar plick graphs. Discuss. Math. Graph Theory 24(1): 41-45 (2004) - Sarah Bendall, Richard H. Hammack:
Centers of n-fold tensor products of graphs. Discuss. Math. Graph Theory 24(3): 491-501 (2004) - Endre Boros, Robert E. Jamison, Renu C. Laskar, Henry Martyn Mulder:
On 3-simplicial vertices in planar graphs. Discuss. Math. Graph Theory 24(3): 413-421 (2004) - Alewyn P. Burger, Christina M. Mynhardt, William D. Weakley:
On the domination number of prisms of graphs. Discuss. Math. Graph Theory 24(2): 303-318 (2004) - Massimiliano Caramia, Jirí Fiala:
New lower bounds on the weighted chromatic number of a graph. Discuss. Math. Graph Theory 24(2): 183-195 (2004) - Maw-Shang Chang, Ruo-Wei Hung:
A simple linear algorithm for the connected domination problem in circular-arc graphs. Discuss. Math. Graph Theory 24(1): 137-145 (2004) - Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Radio k-colorings of paths. Discuss. Math. Graph Theory 24(1): 5-21 (2004) - Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender:
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24(3): 359-372 (2004) - Gek Ling Chia, C. S. Gan:
Minimal regular graphs with given girths and crossing numbers. Discuss. Math. Graph Theory 24(2): 223-237 (2004) - Ernest J. Cockayne, Art Stephen Finbow:
Generalised irredundance in graphs: Nordhaus-Gaddum bounds. Discuss. Math. Graph Theory 24(1): 147-160 (2004) - F. Dahme, Dieter Rautenbach, Lutz Volkmann:
Some remarks on alpha-domination. Discuss. Math. Graph Theory 24(3): 423-430 (2004) - Aneta Dudek, Adam Pawel Wojda:
Pm-saturated bipartite graphs with minimum size. Discuss. Math. Graph Theory 24(2): 197-211 (2004) - Geoffrey Exoo:
Some applications of pq-groups in graph theory. Discuss. Math. Graph Theory 24(1): 109-114 (2004) - Alastair Farrugia, R. Bruce Richter:
Unique factorisation of additive induced-hereditary properties. Discuss. Math. Graph Theory 24(2): 319-343 (2004) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Forbidden triples implying Hamiltonicity: for all graphs. Discuss. Math. Graph Theory 24(1): 47-54 (2004) - Odile Favaron, Gerd Fricke, Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Petter Kristiansen, Renu C. Laskar, R. Duane Skaggs:
Offensive alliances in graphs. Discuss. Math. Graph Theory 24(2): 263-175 (2004) - Dalibor Froncek:
Cyclic decompositions of complete graphs into spanning trees. Discuss. Math. Graph Theory 24(2): 345-353 (2004) - Dalibor Froncek, Zdenek Ryjácek, Zdzislaw Skupien:
On traceability and 2-factors in claw-free graphs. Discuss. Math. Graph Theory 24(1): 55-71 (2004) - Hortensia Galeana-Sánchez:
Some sufficient conditions on odd directed cycles of bounded length for the existence of a kernel. Discuss. Math. Graph Theory 24(2): 171-182 (2004) - Hortensia Galeana-Sánchez:
Cycle-pancyclism in bipartite tournaments I. Discuss. Math. Graph Theory 24(2): 277-290 (2004) - Hortensia Galeana-Sánchez:
Cycle-pancyclism in bipartite tournaments II. Discuss. Math. Graph Theory 24(3): 529-538 (2004) - Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On the heterochromatic number of circulant digraphs. Discuss. Math. Graph Theory 24(1): 73-79 (2004) - Wayne Goddard, Teresa W. Haynes, Debra J. Knisley:
Hereditary domination and independence parameters . Discuss. Math. Graph Theory 24(2): 239-248 (2004) - Lucien Haddad, Claude Tardif:
A clone-theoretic formulation of the Erdös-Faber-Lovász conjecture. Discuss. Math. Graph Theory 24(3): 545-549 (2004) - Bert L. Hartnell, Douglas F. Rall:
On dominating the Cartesian product of a graph and K2. Discuss. Math. Graph Theory 24(3): 389-402 (2004) - Teresa W. Haynes, Michael A. Henning, Lora Hopkins:
Total domination subdivision numbers of graphs. Discuss. Math. Graph Theory 24(3): 457-467 (2004) - Le Xuan Hung, Ngo Dac Tan:
Hamilton cycles in split graphs with large minimum degree. Discuss. Math. Graph Theory 24(1): 23-40 (2004) - Stanislav Jendrol', Heinz-Jürgen Voss:
Light classes of generalized stars in polyhedral maps on surfaces. Discuss. Math. Graph Theory 24(1): 85-107 (2004)
skipping 14 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-25 15: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