![](https://dblp.org/img/logo.ua.320x120.png)
![](https://dblp.org/img/dropdown.dark.16x16.png)
![](https://dblp.org/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.org/img/search.dark.16x16.png)
![search dblp](https://dblp.org/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 36 matches
- 1993
- Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
On the honesty of graph complements. Discret. Math. 122(1-3): 1-6 (1993) - Paola Bandieri
:
Contracted k-tessellations of closed surfaces. Discret. Math. 122(1-3): 7-13 (1993) - Béla Bollobás, Imre Leader:
Maximal sets of given diameter in the grid and the torus. Discret. Math. 122(1-3): 15-35 (1993) - Miklós Bóna
:
A Euclidean Ramsey theorem. Discret. Math. 122(1-3): 349-352 (1993) - Haitze J. Broersma
, Jan van den Heuvel, Henk Jan Veldman:
A generalization of Ore's Theorem involving neighborhood unions. Discret. Math. 122(1-3): 37-49 (1993) - Richard A. Brualdi, Jennifer J. Quinn Massey:
Incidence and strong edge colorings of graphs. Discret. Math. 122(1-3): 51-58 (1993) - William Y. C. Chen:
The theory of compositionals. Discret. Math. 122(1-3): 59-87 (1993) - Ernest J. Cockayne, Christina M. Mynhardt
:
The sequence of upper and lower domination, independence and irredundance numbers of a graph. Discret. Math. 122(1-3): 89-102 (1993) - Karen L. Collins:
Factoring distance matrix polynomials. Discret. Math. 122(1-3): 103-112 (1993) - Sandip Das, Malay K. Sen:
An interval digraph in relation to its associated bipartite graph. Discret. Math. 122(1-3): 113-136 (1993) - T. C. Enns:
Hamiltonian circuits and paths in subset graphs with circular adjacency. Discret. Math. 122(1-3): 153-165 (1993) - Clelia de Felice
:
A partial result about the factorization conjecture for finite variable-length codes. Discret. Math. 122(1-3): 137-152 (1993) - Hortensia Galeana-Sánchez:
Normal fraternally orientable graphs satisfy the strong perfect graph conjecture. Discret. Math. 122(1-3): 167-177 (1993) - Pierre Hansen, Maolin Zheng:
A linear algorithm for perfect matching in hexagonal systems. Discret. Math. 122(1-3): 179-196 (1993) - Denis Hanson, Gary MacGillivray, Dale Youngs:
The size of a minimum five-chromatic K4-free graph. Discret. Math. 122(1-3): 353-355 (1993) - Jochen Harant:
An upper bound for the radius of a 3-connected graph. Discret. Math. 122(1-3): 335-341 (1993) - Frank Harary, Serge Lawrencenko
, Vladimir P. Korzhik:
Realizing the chromatic numbers of triangulations of surfaces. Discret. Math. 122(1-3): 197-204 (1993) - Peter Horák, Zsolt Tuza:
Large s-representable set systems with low maximum degree. Discret. Math. 122(1-3): 205-217 (1993) - Alexander V. Ivashchenko:
Representation of smooth surfaces by graphs. Transformations of graphs which do not change the Euler characteristic of graphs. Discret. Math. 122(1-3): 219-233 (1993) - Xing-De Jia:
Some remarks on minimal bases and maximal nonbases of integers. Discret. Math. 122(1-3): 357-362 (1993) - Krzysztof Kolodziejczyk:
Borsuk covering and planar sets with unique completion. Discret. Math. 122(1-3): 235-244 (1993) - Chunhui Lai
:
On the size of graphs with all cycle having distinct length. Discret. Math. 122(1-3): 363-364 (1993) - Renu C. Laskar, S. Stueckle, Barry L. Piazza:
On the edge-integrity of some graphs and their complements. Discret. Math. 122(1-3): 245-253 (1993) - Charles Laywine:
A counter-example to a conjecture relating complete sets of frequency squares and affine geometries. Discret. Math. 122(1-3): 255-262 (1993) - Nian-Zu Li, Earl Glen Whitehead Jr.:
The chromaticity of certain graphs with five triangles. Discret. Math. 122(1-3): 365-372 (1993) - Eduardo Montenegro, Reinaldo Salazar:
A result about the incident edges in the graphs Mk. Discret. Math. 122(1-3): 377-380 (1993) - Giuseppe Pirillo:
On a combinatorial property of Fibonacci semigroup. Discret. Math. 122(1-3): 263-267 (1993) - Richard L. Roth:
Perfect colorings of multipatterns in the plane. Discret. Math. 122(1-3): 269-286 (1993) - Sergiu Rudeanu:
Unique solutions of Boolean ring equations. Discret. Math. 122(1-3): 381-383 (1993) - Marko Lovrecic Sarazin:
On the hamiltonian index of a graph. Discret. Math. 122(1-3): 373-376 (1993)
skipping 6 more matches
loading more results
failed to load more results, please try again later
![](https://dblp.org/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-07-07 06:44 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