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 48 matches
- 2006
- Lech Adamus:
Long cycles in graphs and digraphs. Electron. Notes Discret. Math. 24: 3-7 (2006) - F. Aguiló-Gost, Alicia Miralles, Marisa Zaragozá:
Using Double-Loop digraphs for solving Frobenius' Problems. Electron. Notes Discret. Math. 24: 17-24 (2006) - Méziane Aïder, Sylvain Gravier, Kahina Meslem:
Isometric embedding of subdivided Connected graphs in the hypercube. Electron. Notes Discret. Math. 24: 145-151 (2006) - Kiyoshi Ando:
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. Electron. Notes Discret. Math. 24: 25-30 (2006) - Vladimir I. Benediktovich:
Plane subgraphs in geometric complement of 2-factor and complete bipartite geometric graph. Electron. Notes Discret. Math. 24: 31-38 (2006) - Halina Bielak:
Size Ramsey numbers for some regular graphs. Electron. Notes Discret. Math. 24: 39-45 (2006) - Simona Bonvicini, Giuseppe Mazzuoccolo:
On perfectly one-factorable cubic graphs. Electron. Notes Discret. Math. 24: 47-51 (2006) - Csilla Bujtás, Zsolt Tuza:
Mixed colorings of hypergraphs. Electron. Notes Discret. Math. 24: 273-275 (2006) - Tiziana Calamoneri, Annalisa Massini, Lubomir Torok, Imrich Vrto:
Antibandwidth of Complete k-Ary Trees. Electron. Notes Discret. Math. 24: 259-266 (2006) - F. Affif Chaouche, Abdelhafid Berrachedi:
Automorphisms group of generalized Hamming Graphs. Electron. Notes Discret. Math. 24: 9-15 (2006) - Miroslav Chladný, Martin Skoviera:
Decompositions of Snarks into Repeated Dot-Products. Electron. Notes Discret. Math. 24: 215-222 (2006) - Sylwia Cichacz, Agnieszka Görlich:
Decomposition of complete bipartite graphs into open trails. Electron. Notes Discret. Math. 24: 53-55 (2006) - Matt DeVos, Bojan Mohar:
Small separations in vertex-transitive graphs. Electron. Notes Discret. Math. 24: 165-172 (2006) - Ewa Drgas-Burchardt:
On k-chromatically unique and k-chromatically equivalent hypergraphs. Electron. Notes Discret. Math. 24: 57-60 (2006) - Ewa Drgas-Burchardt, Ewa Lazuka:
On chromatic polynomials of hypergraphs. Electron. Notes Discret. Math. 24: 105-110 (2006) - Evelyne Flandrin, Hao Li, Roman Cada:
Hamiltonicity and pancyclicity of generalized prisms. Electron. Notes Discret. Math. 24: 61-67 (2006) - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs. Electron. Notes Discret. Math. 24: 277-284 (2006) - Takuro Fukunaga, Hiroshi Nagamochi:
Some Theorems on Detachments Preserving Local-Edge-Connectivity. Electron. Notes Discret. Math. 24: 173-180 (2006) - Andrei Gagarin, Gilbert Labelle, Pierre Leroux:
The structure and unlabelled enumeration of toroidal graphs with no K3, 3's. Electron. Notes Discret. Math. 24: 69-76 (2006) - Izolda Gorgol, Ewa Lazuka:
Rainbow numbers for certain graphs. Electron. Notes Discret. Math. 24: 77-79 (2006) - Harald Gropp:
Hamiltonian graphs from Kirkman to König. Electron. Notes Discret. Math. 24: 81-88 (2006) - M. Carmen Hernando, Mercè Mora, Ignacio M. Pelayo, Carlos Seara:
Some structural, metric and convex properties on the boundary of a graph. Electron. Notes Discret. Math. 24: 203-209 (2006) - Mirko Hornák, Mariusz Wozniak:
On neighbour-distinguishing colourings from lists. Electron. Notes Discret. Math. 24: 295-297 (2006) - Wojciech Kordecki, Anna Lyczkowska-Hanckowiak:
Expected value of the minimal basis of random matroid and distributions of q-analogs of order statistics. Electron. Notes Discret. Math. 24: 117-123 (2006) - Mark Korenblit, Vadim E. Levit:
Nested Graphs. Electron. Notes Discret. Math. 24: 93-99 (2006) - Y. V. Krylou, A. J. Perez Tchernov:
On the problem of domino recognition. Electron. Notes Discret. Math. 24: 251-258 (2006) - Malgorzata Kuchta, Jolanta Stasiak:
Maximal Binary Cliques. Electron. Notes Discret. Math. 24: 237-241 (2006) - Roman Kuzel:
The Dominating Circuit Conjecture and Subgraphs of Essentially 4-Edge Connected Cubic Graphs. Electron. Notes Discret. Math. 24: 101-104 (2006) - Anna Beata Kwiatkowska, Maciej M. Syslo:
On Page Number of N-free Posets. Electron. Notes Discret. Math. 24: 243-249 (2006) - V. V. Lepin:
A Linear Algorithm for Computing of a Minimum Weight Maximal Induced Matching in an Edge-Weighted Tree. Electron. Notes Discret. Math. 24: 111-116 (2006)
skipping 18 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-11-04 19:04 CET 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