![](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 28 matches
- 1998
- Ghidewon Abay-Asmerom:
Imbeddings of the tensor product of graphs where the second factor is a complete graph. Discret. Math. 182(1-3): 13-19 (1998) - H. L. Abbott, Donovan R. Hare, Bing Zhou:
Color-critical graphs and hypergraphs with few edges and no short cycles. Discret. Math. 182(1-3): 3-11 (1998) - Tomasz Bilski
:
Optimum embedding of complete graphs in books. Discret. Math. 182(1-3): 21-28 (1998) - Bruno Courcelle, Géraud Sénizergues:
The obstructions of a minor-closed set of graphs defined by a context-free grammar. Discret. Math. 182(1-3): 29-51 (1998) - France Dacar:
The cyclicity of a hypergraph. Discret. Math. 182(1-3): 53-67 (1998) - Edwin R. van Dam
, Willem H. Haemers
:
Graphs with constant µ and µ_. Discret. Math. 182(1-3): 293-307 (1998) - Italo J. Dejter
, Héctor Hevia, Oriol Serra:
Hidden Cayley graph structures. Discret. Math. 182(1-3): 69-83 (1998) - Xin Gui Fang, Cai Heng Li, Cheryl E. Praeger
:
On orbital regular graphs and frobenius graphs. Discret. Math. 182(1-3): 85-99 (1998) - Miguel Angel Fiol, Ernest Garriga, José Luis Andres Yebra:
Boundary graphs - II The limit case of a spectral property. Discret. Math. 182(1-3): 101-111 (1998) - Zhicheng Gao, Xingxing Yu:
Tutte cycles in circuit graphs. Discret. Math. 182(1-3): 113-124 (1998) - Luigi Grasselli
, Salvina Piccarreta:
Tetrahedron manifolds via coloured graphs. Discret. Math. 182(1-3): 125-137 (1998) - Barry Guiduli, Zoltán Király:
On intersecting hypergraphs. Discret. Math. 182(1-3): 139-151 (1998) - Pranava K. Jha:
Kronecker products of paths and cycles: Decomposition, factorization and bi-pancyclicity. Discret. Math. 182(1-3): 153-167 (1998) - Michael Jünger, Petra Mutzel
, Thomas Odenthal, Mark Scharbrodt:
The thickness of a minor-excluded class of graphs. Discret. Math. 182(1-3): 169-176 (1998) - Aleksandar Jurisic:
Antipodal covers of strongly regular graphs. Discret. Math. 182(1-3): 177-189 (1998) - Michael A. Langston, Barbara C. Plaut:
On algorithmic applications of the immersion order : An overview of ongoing work presented at the Third Slovenian International Conference on Graph Theory. Discret. Math. 182(1-3): 191-196 (1998) - Aleksander Malnic:
Group actions, coverings and lifts of automorphisms. Discret. Math. 182(1-3): 203-218 (1998) - Dragan Marusic
:
Recent developments in half-transitive graphs. Discret. Math. 182(1-3): 219-231 (1998) - Dragan Marusic, Bojan Mohar:
Preface. Discret. Math. 182(1-3): 1 (1998) - Lorenzo Milazzo, Zsolt Tuza:
Strict colourings for classes of steiner triple systems. Discret. Math. 182(1-3): 233-243 (1998) - Bojan Mohar:
On the orientable genus of graphs with bounded nonorientable genus. Discret. Math. 182(1-3): 245-253 (1998) - Eugene T. Neufeld:
Orienting cycle elements in orientable rotation systems. Discret. Math. 182(1-3): 255-265 (1998) - H. Pulapaka, Andrew Vince
:
Non-revisiting paths on surfaces with low genus. Discret. Math. 182(1-3): 267-277 (1998) - Marko Lovrecic Sarazin:
On the hamiltonian index and the radius of a graph. Discret. Math. 182(1-3): 197-202 (1998) - Ákos Seress:
On vertex-transitive, non-Cayley graphs of order pqr. Discret. Math. 182(1-3): 279-292 (1998) - Aleksander Vesel, Janez Zerovnik
:
The independence number of the strong product of odd cycles. Discret. Math. 182(1-3): 333-336 (1998) - Ming-Yao Xu:
Automorphism groups and isomorphisms of Cayley digraphs. Discret. Math. 182(1-3): 309-319 (1998) - Boris Zgrablic:
On adjacency-transitive graphs. Discret. Math. 182(1-3): 321-332 (1998)
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-09-04 08:17 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