Остановите войну!
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 49 matches
- 2007
- Ahmed Ainouche, Serge Lapiquonne:
Variations on a sufficient condition for Hamiltonian graphs. Discuss. Math. Graph Theory 27(2): 229-240 (2007) - Anthony Bonato:
A note on uniquely H-colorable graphs. Discuss. Math. Graph Theory 27(1): 39-44 (2007) - Bostjan Bresar, Simon Spacapan:
Edge-connectivity of strong products of graphs. Discuss. Math. Graph Theory 27(2): 333-343 (2007) - Stanislaw Bylka, Jan Komar:
The representation of multi-hypergraphs by set intersections. Discuss. Math. Graph Theory 27(3): 565-582 (2007) - Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Distance defined by spanning trees in graphs. Discuss. Math. Graph Theory 27(3): 485-506 (2007) - Mustapha Chellali, Teresa W. Haynes:
Global Alliances and Independence in Trees. Discuss. Math. Graph Theory 27(1): 19-27 (2007) - Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Katsuhiro Ota, Akira Saito, Ingo Schiermeyer:
Chvátal Erdós condition and 2-factors with a specyfied number of components. Discuss. Math. Graph Theory 27(3): 401-407 (2007) - Sylwia Cichacz:
Decomposition of complete bipartite digraphs and even complete multigraphs into closed trails. Discuss. Math. Graph Theory 27(2): 241-249 (2007) - Andrey A. Dobrynin, Leonid S. Melnikov, Artem V. Pyatkin:
Erdõs regular graphs of even degree. Discuss. Math. Graph Theory 27(2): 269-279 (2007) - Zyta Dziechcinska-Halamoda, Zofia Majcher, Jerzy Michael, Zdzislaw Skupien:
A Sokoban-type game and arc deletion within irregular digraphs of all sizes. Discuss. Math. Graph Theory 27(3): 611-622 (2007) - Brice Effantin, Hamamache Kheddouci:
Grundy number of graphs. Discuss. Math. Graph Theory 27(1): 5-18 (2007) - Kim A. S. Factor, Larry J. Langley:
Digraphs with underlying and domination graphs: Connected UGc(D). Discuss. Math. Graph Theory 27(1): 51-67 (2007) - Yi-Zheng Fan, Shi-Cai Gong:
Nonsingular unicyclic mixed graphs with at most three eigenvalues greater than two. Discuss. Math. Graph Theory 27(1): 69-82 (2007) - Yi-Zheng Fan, Yi Wang, Jun Zhou:
On the second largest eigenvalue of a mixed graph. Discuss. Math. Graph Theory 27(2): 373-384 (2007) - Michael J. Ferrara, Ronald J. Gould, Stephen G. Hartke:
The structure and existence of 2-factors in iterated line graphs. Discuss. Math. Graph Theory 27(3): 507-526 (2007) - Waclaw Frydrych, Andrzej Zak:
Preface to Proceedings. Discuss. Math. Graph Theory 27(3): 561- (2007) - Hortensia Galeana-Sánchez, Ricardo Gómez:
(k, l)-kernels, (k, l)-semikernels, k-Grundy functions and duality for state splittings. Discuss. Math. Graph Theory 27(2): 359-371 (2007) - Hortensia Galeana-Sánchez, Luis Alberto Jiménez Ramírez:
Monochromatic kernel-perfectness of special classes of digraphs. Discuss. Math. Graph Theory 27(3): 389-400 (2007) - Richard G. Gibson, Christina M. Mynhardt:
Couterexample to a conjecture on the structure of bipartite partionable graphs. Discuss. Math. Graph Theory 27(3): 527-540 (2007) - Wayne Goddard, Kiran Kanakadandi:
Orientation distance graphs revisited. Discuss. Math. Graph Theory 27(1): 125-136 (2007) - Jurriaan Hage, Tero Harju:
Towards a characterization of bipartite switching classes by means of forbidden subgraphs. Discuss. Math. Graph Theory 27(3): 471-483 (2007) - Pooya Hatami:
An approximation algorithm for the total covering problem. Discuss. Math. Graph Theory 27(3): 553-558 (2007) - Wenjie He, Yufa Shen, Guoping Zheng:
Improved upper bounds for nearly antipodal chromatic number of paths. Discuss. Math. Graph Theory 27(1): 159-174 (2007) - Suresh Manjanath Hegde, Mirka Miller:
Futher results on sequetially additive graphs. Discuss. Math. Graph Theory 27(2): 251-268 (2007) - Pak-Tung Ho:
A proof of the crossing number of K3, n in a surface. Discuss. Math. Graph Theory 27(3): 549-551 (2007) - Premysl Holub:
On distance local connectivity and vertex distance colouring. Discuss. Math. Graph Theory 27(2): 209-227 (2007) - Xinmin Hou:
Total domination of Cartesian products of graphs. Discuss. Math. Graph Theory 27(1): 175-178 (2007) - Wilfried Imrich, Werner Klöckl:
Factoring directed graphs with respect to the cardinal product in polynomial time. Discuss. Math. Graph Theory 27(3): 593-601 (2007) - Jaroslav Ivanco:
Magic and supermagic dense bipartite graphs. Discuss. Math. Graph Theory 27(3): 583-591 (2007) - Mustapha Kchikech, Riadh Khennoufa, Olivier Togni:
Linear and cyclic radio k-labelings of trees. Discuss. Math. Graph Theory 27(1): 105-123 (2007)
skipping 19 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-23 17:42 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