![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.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 29 matches
- 1998
- Olof Barr:
Properly Coloured Hamiltonian Paths in Edge-Coloured Complete Graphs without Monochromatic Triangles. Ars Comb. 50 (1998) - Uri Blass, Simon Litsyn:
Several new lower bounds for football pool systems. Ars Comb. 50 (1998) - Béla Bollobás, Paul Erdös:
Graphs of Extremal Weights. Ars Comb. 50 (1998) - Gunnar Brinkmann, Eckhard Steffen:
Snarks and Reducibility. Ars Comb. 50 (1998) - Izak Broere, Jean E. Dunbar, Johannes H. Hattingh:
Minus k-subdomination in graphs. Ars Comb. 50 (1998) - Zhi-Hong Chen:
Fan-Type Conditions for Collapsible Graphs. Ars Comb. 50 (1998) - Charles J. Colbourn, Jianxing Yin:
On Directed Incomplete Transversal Designs with Block Size Five. Ars Comb. 50 (1998) - Giorgio Faina, Stefano Marcugini, Alfredo Milani, Fernanda Pambianco:
The sizes k of the complete k-caps in PG(n, q), for small q and 3 <= n >= 5. Ars Comb. 50 (1998) - Zdzislaw Grodzki, Aleksander Wronski:
Generalized de Bruijn multigraphs of rank k. Ars Comb. 50 (1998) - S. Louis Hakimi, John Mitchem, Edward F. Schmeichel:
Short Proofs of Theorems of Nash-Williams and Tutte. Ars Comb. 50 (1998) - Noboru Hamada:
The Nonexistence of Ternary [231, 6, 153] Codes. Ars Comb. 50 (1998) - Denis Hanson, C. O. M. Loten, Bjarne Toft:
On interval colourings of bi-regular bipartite graphs. Ars Comb. 50 (1998) - Johannes H. Hattingh, Michael A. Henning, Jacobus L. Walters:
Distance irredundance in graphs: complexity issues. Ars Comb. 50 (1998) - Thomas Hofmeister, Hanno Lefmann:
On k-Partite Subgraphs. Ars Comb. 50 (1998) - Iiro S. Honkala:
Combinatorial lower bounds on binary codes with covering radius one. Ars Comb. 50 (1998) - Sho Ishizuka:
Closure, Path-Factors and Path Coverings in Claw-Free Graphs. Ars Comb. 50 (1998) - Pranava K. Jha, Sandi Klavzar:
Independence in Direct-Product Graphs. Ars Comb. 50 (1998) - Dawn M. Jones, Denny James Roehm, Michelle Schultz:
On Matchings in Graphs. Ars Comb. 50 (1998) - Suh-Ryung Kim, Fred S. Roberts:
The Elimination Procedure for the Competition Number. Ars Comb. 50 (1998) - Jin Ho Kwak, Jaeun Lee:
Isomorphism classes of bipartite cycle permutation graphs. Ars Comb. 50 (1998) - Mingchu Li:
On Pancyclic Claw-Free Graphs. Ars Comb. 50 (1998) - Alan C. H. Ling, Charles J. Colbourn:
Deleting Lines in Projective Planes. Ars Comb. 50 (1998) - Michele Mulazzani:
Stiff Genus of Groups. Ars Comb. 50 (1998) - Purwanto, W. D. Wallis:
Minimum Order of a Graph with Given Deficiency and Either Minimum or Maximum Degree. Ars Comb. 50 (1998) - Gaetano Quattrocchi:
Spanning Sets and Scattering Sets in Handcuffed Designs of order v and block size 3. Ars Comb. 50 (1998) - C. Pandu Rangan, K. R. Parthasarathy, V. Prakash:
On The g-centroidal Problem in Special Classes of Perfect Graphs. Ars Comb. 50 (1998) - Neville Robbins:
Some New Partition Identities. Ars Comb. 50 (1998) - Kishore Sinha, Byron Jones, Sanpei Kageyama:
A Series of quasi-multiple BIB Designs from Hadamard Matrices. Ars Comb. 50 (1998) - Hongquan Yu, Tianming Wang:
An Inequality on Connected Domination Parameters. Ars Comb. 50 (1998)
loading more results
failed to load more results, please try again later
![](https://dblp1.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-07-01 02: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