Остановите войну!
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 29 matches
- 2002
- Amitava Bhattacharya, Gurusamy Rengasamy Vijayakumar:
Effect of edge-subdivision on vertex-domination in a graph. Discuss. Math. Graph Theory 22(2): 335-347 (2002) - J. Adrian Bondy, Hajo Broersma, Jan van den Heuvel, Henk Jan Veldman:
Heavy cycles in weighted graphs. Discuss. Math. Graph Theory 22(1): 7-15 (2002) - Mieczyslaw Borowiecki, Elzbieta Sidorowicz:
Weakly P-saturated graphs. Discuss. Math. Graph Theory 22(1): 17-29 (2002) - Izak Broere, Jozef Bucko, Peter Mihók:
Criteria of the existence of uniquely partionable graphs with respect to additive induced-hereditary properties. Discuss. Math. Graph Theory 22(1): 31-37 (2002) - Izak Broere, Samantha Dorfling, Elizabeth Jonck:
Generalized chromatic numbers and additive hereditary properties of graphs. Discuss. Math. Graph Theory 22(2): 259-270 (2002) - Hajo Broersma, Xueliang Li:
Isomorphisms and traversability of directed path graphs. Discuss. Math. Graph Theory 22(2): 215-228 (2002) - Ibrahim Cahit:
Some totally modular cordial graphs. Discuss. Math. Graph Theory 22(2): 247-258 (2002) - Andrey A. Dobrynin, Leonid S. Melnikov, Jens Schreyer, Hansjoachim Walther:
Some news about oblique graphs. Discuss. Math. Graph Theory 22(1): 39-50 (2002) - Michael Dorfling, Samantha Dorfling:
Generalized edge-chromatic numbers and additive hereditary properties of graphs. Discuss. Math. Graph Theory 22(2): 349-359 (2002) - Andreas Eisenblätter, Martin Grötschel, Arie M. C. A. Koster:
Frequency planning and ramifications of coloring. Discuss. Math. Graph Theory 22(1): 51-88 (2002) - Jirí Fiala, Jan Kratochvíl:
Partial covers of graphs. Discuss. Math. Graph Theory 22(1): 89-99 (2002) - Patrick W. Fowler, Peter E. John:
Dûrer polyhedra: The dark side of melancholia. Discuss. Math. Graph Theory 22(1): 101-109 (2002) - Tobias Gerlach, Jochen Harant:
A note on domination in bipartite graphs. Discuss. Math. Graph Theory 22(2): 229-231 (2002) - Frank Göring:
A proof of Menger's Theorem by contraction. Discuss. Math. Graph Theory 22(1): 111-112 (2002) - Jochen Harant, Ingo Schiermeyer, Margit Voigt:
Preface. Discuss. Math. Graph Theory 22(1): 5-6 (2002) - Teresa W. Haynes, Michael A. Henning:
Trees with unique minimum total dominating sets. Discuss. Math. Graph Theory 22(2): 233-246 (2002) - Michael A. Henning:
A characterization of Roman trees. Discuss. Math. Graph Theory 22(2): 325-334 (2002) - Jaroslav Ivanco, Mariusz Meszka, Zdzislaw Skupien:
Decompositions of multigraphs into parts with two edges. Discuss. Math. Graph Theory 22(1): 113-121 (2002) - Judith Keijsper, Meike Tewes:
Conditions for β-perfectness. Discuss. Math. Graph Theory 22(1): 123-148 (2002) - Arnfried Kemnitz, Massimiliano Marangio:
Edge colorings and total colorings of integer distance graphs. Discuss. Math. Graph Theory 22(1): 149-158 (2002) - Benoît Larose:
Families of strongly projective graphs. Discuss. Math. Graph Theory 22(2): 271-292 (2002) - Tomás Madaras, Andrea Marcinova:
On the structural result on normal plane maps. Discuss. Math. Graph Theory 22(2): 293-303 (2002) - Bert Randerath, Preben D. Vestergaard:
On well-covered graphs of odd girth 7 or greater. Discuss. Math. Graph Theory 22(1): 159-172 (2002) - Varaporn Saenpholphat, Ping Zhang:
Connected partition dimensions of graphs. Discuss. Math. Graph Theory 22(2): 305-323 (2002) - Richard H. Schelp:
Three edge-coloring conjectures. Discuss. Math. Graph Theory 22(1): 173-182 (2002) - Gabriel Semanisin:
On generating sets of induced-hereditary properties. Discuss. Math. Graph Theory 22(1): 183-192 (2002) - Zdzislaw Skupien:
Clique parts independent of remainders. Discuss. Math. Graph Theory 22(2): 361-361 (2002) - Michal Tkác, Heinz-Jürgen Voss:
On k-trestles in polyhedreal graphs. Discuss. Math. Graph Theory 22(1): 193-198 (2002) - Zsolt Tuza, Preben D. Vestergaard:
Domination in partitioned graphs. Discuss. Math. Graph Theory 22(1): 199-210 (2002)
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-31 06:12 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