Остановите войну!
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 51 matches
- 2003
- Atif A. Abueida, Mike Daven:
Multidesigns for Graph-Pairs of Order 4 and 5. Graphs Comb. 19(4): 433-447 (2003) - Peter Adams, Darryn E. Bryant, Saad I. El-Zanati, Heather Gavlas:
Factorizations of the Complete Graph into C 5-Factors and 1-Factors. Graphs Comb. 19(3): 289-296 (2003) - Ahmed Ainouche, Ingo Schiermeyer:
0-Dual Closures for Several Classes of Graphs. Graphs Comb. 19(3): 297-307 (2003) - Noga Alon, Simon Litsyn, Raphael Yuster:
A Coding Theory Bound and Zero-Sum Square Matrices. Graphs Comb. 19(4): 449-457 (2003) - David Austin, Heather Gavlas, Dave Witte:
Hamiltonian Paths in Cartesian Powers of Directed Cycles. Graphs Comb. 19(4): 459-466 (2003) - Josep M. Brunat, Miguel Angel Fiol, Montserrat Maureso:
Chromatic Automorphisms of Consecutive Digraphs. Graphs Comb. 19(2): 145-159 (2003) - Darryn E. Bryant, Mike J. Grannell, Terry S. Griggs, Barbara M. Maenhaut:
On the Volume of 4-Cycle Trades. Graphs Comb. 19(1): 53-63 (2003) - Robert Castelo, Nicholas C. Wormald:
Enumeration of P 4-Free Chordal Graphs. Graphs Comb. 19(4): 467-474 (2003) - Irène Charon, Olivier Hudry:
Links between the Slater Index and the Ryser Index of Tournaments. Graphs Comb. 19(3): 309-322 (2003) - Guantao Chen, Frank J. Hall, Zhongshan Li, Bing Wei:
On Ranks of Matrices Associated with Trees. Graphs Comb. 19(3): 323-334 (2003) - Vasek Chvátal:
Claude Berge: 5.6.1926-30.6.2002. Graphs Comb. 19(1): 1-6 (2003) - Charles J. Colbourn, Alexander Rosa:
Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs Comb. 19(3): 335-345 (2003) - Diane M. Donovan, Abdollah Khodkar, Anne Penfold Street:
Doubling and Tripling Constructions for Defining Sets in Steiner Triple Systems. Graphs Comb. 19(1): 65-89 (2003) - Mark N. Ellingham, Xiaoya Zha:
Separating Cycles in Doubly Toroidal Embeddings. Graphs Comb. 19(2): 161-175 (2003) - Jonathan David Farley:
Quasi-Differential Posets and Cover Functions of Distributive Lattices II: A Problem in Stanley's Enumerative Combinatorics. Graphs Comb. 19(4): 475-491 (2003) - Graham Farr, Peter Eades:
Skewness of Graphs with Small Cutsets. Graphs Comb. 19(2): 177-194 (2003) - Fedor V. Fomin:
Pathwidth of Planar and Line Graphs. Graphs Comb. 19(1): 91-99 (2003) - Michael U. Gerber, Vadim V. Lozin:
Robust Algorithms for the Stable Set Problem. Graphs Comb. 19(3): 347-356 (2003) - John Gimbel:
Some Remarks on the Convexity Number of a Graph. Graphs Comb. 19(3): 357-361 (2003) - Ronald J. Gould:
Advances on the Hamiltonian Problem - A Survey. Graphs Comb. 19(1): 7-52 (2003) - Mariko Hagita, André Kündgen, Douglas B. West:
Probabilistic Methods for Decomposition Dimension of Graphs. Graphs Comb. 19(4): 493-503 (2003) - Akihide Hanaki:
Representations of Association Schemes and Their Factor Schemes. Graphs Comb. 19(2): 195-201 (2003) - Akihide Hanaki:
Characters of Association Schemes and Normal Closed Subsets. Graphs Comb. 19(3): 363-369 (2003) - Masaaki Harada, Patric R. J. Östergård:
On the Classification of Self-Dual Codes over F5. Graphs Comb. 19(2): 203-214 (2003) - Frédéric Havet:
On Unavoidability of Trees with kLeaves. Graphs Comb. 19(1): 101-110 (2003) - Akira Hiraki:
The Number of Columns (1, k-2, 1) in the Intersection Array of a Distance-Regular Graph. Graphs Comb. 19(3): 371-387 (2003) - Iiro S. Honkala, Tero Laihonen:
Codes for Identification in the King Lattice. Graphs Comb. 19(4): 505-516 (2003) - Xinmin Hou, Bolian Liu, Tianming Wang:
An Algorithm to Construct k-Regular k-Connected Graphs with the Maximum k-Diameter. Graphs Comb. 19(1): 111-119 (2003) - Stanislav Jendrol', Peter J. Owens:
Erratum. Graphs Comb. 19(4): 517-518 (2003) - Volker Kaibel, Alexander Schwartz:
On the Complexity of Polytope Isomorphism Problems. Graphs Comb. 19(2): 215-230 (2003)
skipping 21 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-25 06:48 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