Остановите войну!
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 25 matches
- 2003
- S. Amghibech:
Eigenvalues of the Discrete p-Laplacian for Graphs. Ars Comb. 67 (2003) - Mahesh M. Andar, Samina Boxwala, Nirmala B. Limaye:
On the Cordiality of the t-Uniform Homeomorphs - II (Complete Graphs). Ars Comb. 67 (2003) - Hui Kheng Aw, Yeow Meng Chee, Alan C. H. Ling:
Six New Constant Weight Binary Codes. Ars Comb. 67 (2003) - J. Barraud, A. Panayotopoulos, Panagiotis Tsikouras:
Properties of closed meanders. Ars Comb. 67 (2003) - Andreas Brandstädt, Vadim V. Lozin:
On the linear structure and clique-width of bipartite permutation graphs. Ars Comb. 67 (2003) - Fred Buckley, Wing Yen Lau:
Mutually Eccentric Vertices in Graphs. Ars Comb. 67 (2003) - Jou-Ming Chang, Chin-Wen Ho, Ming-Tat Ko:
Powers of Asteroidal Triple-free Graphs with Applications. Ars Comb. 67 (2003) - Gary Chartrand, Peter Dankelmann, Michelle Schultz, Henda C. Swart:
Twin Domination in Digraphs. Ars Comb. 67 (2003) - Margaret Ann Francel, David J. John:
3-Regular Hypergraphs that are Decomposable and Threshold. Ars Comb. 67 (2003) - Ruth Haas, Denis Hanson, Gary MacGillivray:
Bounds For Partial List Colourings. Ars Comb. 67 (2003) - Thomas Hull:
Counting Mountain-Valley Assignments for Flat Folds. Ars Comb. 67 (2003) - Christos Koukouvinos, Jennifer Seberry:
Orthogonal Designs of Kharaghani Type: I. Ars Comb. 67 (2003) - Sin-Min Lee, Ebrahim Salehi:
Integer-Magic Spectra Of Amalgamations Of Stars And Cycles. Ars Comb. 67 (2003) - Mingchu Li:
Circumferences of 2-Connected Claw-Free Graphs. Ars Comb. 67 (2003) - Alan C. H. Ling:
Some applications of combinatorial designs to extremal graph theory. Ars Comb. 67 (2003) - Daphne Der-Fen Liu:
Sizes of Graphs with Fixed Orders and Spans for Circular-Distance-Two Labelings. Ars Comb. 67 (2003) - Florent R. Madelaine, Iain A. Stewart:
Some problems not definable using structure homomorphisms. Ars Comb. 67 (2003) - Paul Renteln:
On the Chromatic Number of the Complement of a Class of Line Graphs. Ars Comb. 67 (2003) - Tay-Woei Shyu, Chiang Lin:
Isomorphic Path Decompositions of Crowns. Ars Comb. 67 (2003) - R. Sternfeld, D. Koster, D. Kiel, R. Killgrove:
Self-Dual Confined Configurations With Ten Points. Ars Comb. 67 (2003) - Koen Thas:
On Semi Quadrangles. Ars Comb. 67 (2003) - Livinus Ugochukwu Uko:
The anatomy of magic squares. Ars Comb. 67 (2003) - Lutz Volkmann:
Degree sequence conditions for super-edge-connected graphs and digraphs. Ars Comb. 67 (2003) - Maged Z. Youssef:
New Families of Graceful Graphs. Ars Comb. 67 (2003) - Raphael Yuster:
A note on graphs without k-connected subgraphs. Ars Comb. 67 (2003)
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-05 02:33 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