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 32 matches
- 2008
- Ian Anderson, Leigh H. M. Ellison:
Z-Cyclic Directed Moore (2, 6) Generalised Whist Tournament Designs on p elements where p = 7 (mod 12). Ars Comb. 87 (2008) - János Barát, Peter P. Varju:
On square-free edge colorings of graphs. Ars Comb. 87 (2008) - Qiuju Bian:
On toughness and fractional f-factors. Ars Comb. 87 (2008) - Bing Chen, Shenggui Zhang:
A New s3 Type Condition for Heavy Cycles in Weighted Graphs. Ars Comb. 87 (2008) - Hui Cheng, Bing Yao, Xiangen Chen, Zhongfu Zhang:
On Graceful Generalized Spiders and Caterpillars. Ars Comb. 87 (2008) - Haci Civciv, Ramazan Turkmen:
On the (s, t)-Fibonacci and Fibonacci Matrix Sequences. Ars Comb. 87 (2008) - Lane H. Clark, J. P. McSorley:
Comment on "The Expectation Of Independent Domination Number Over Random Binary Trees". Ars Comb. 87 (2008) - David DiMarco:
Realizability of Connected, Separable, p-Point, q-Line Graphs with Prescribed Minimum Degree and Line Connectivity. Ars Comb. 87 (2008) - Lynne L. Doty, Kevin Ferland:
Some Maximally Tough Circulants. Ars Comb. 87 (2008) - Yonghui Fan, Yuqin Zhang, Guoyan Ye:
A Cube-Packing Problem. Ars Comb. 87 (2008) - Johannes H. Hattingh, Michael A. Henning:
Restrained Domination Excellent Trees. Ars Comb. 87 (2008) - T. N. Janakiraman, M. Bhanumathi, S. Muthammai:
Self-centered super graph of a graph and center number of a graph. Ars Comb. 87 (2008) - Peter D. Johnson Jr., Matt Walsh:
Fractional inverse and inverse fractional domination. Ars Comb. 87 (2008) - K. Reji Kumar, S. Arumugam, Gary MacGillivray:
On Maximal Fractional Independent Sets In Graphs. Ars Comb. 87 (2008) - Sang-Gu Lee, Han-Guk Seol, Jeong-Mo Yang:
Bound For 2-Exponents of Primitive Extremal Tournaments. Ars Comb. 87 (2008) - Yueping Li, Dingjun Lou, Yunting Lu:
Algorithms For The Optimal Hamiltonian Path In Halin Graphs. Ars Comb. 87 (2008) - Juan Liu, Jixiang Meng:
Super-Arc-Connected and Super-Connected Total Digraphs. Ars Comb. 87 (2008) - Guizhen Liu, Qinglin Yu:
Strongly pan-factorial property in cages. Ars Comb. 87 (2008) - John P. McSorley, Philip Feinsilver, René Schott:
Generating Orthogonal Polynomials and their Derivatives using Vertex-Matching-Partitions of Graphs. Ars Comb. 87 (2008) - Lifeng Ou:
Critically and Minimally Cochromatic Graphs. Ars Comb. 87 (2008) - A. Panayotopoulos, Panayiotis M. Vlamos:
Meandric polygons. Ars Comb. 87 (2008) - Pratima Panigrahi, Debdas Mishra:
Graceful Lobsters Obtained from Diameter Four Trees Using Partitioning Technique. Ars Comb. 87 (2008) - Rodolfo Salvi, Norma Zagaglia Salvi:
Alternating unimodal sequences of Whitney numbers. Ars Comb. 87 (2008) - M. A. Seoud, E. A. El Sakhawi:
On Variations of Graceful Labelings. Ars Comb. 87 (2008) - Moo Young Sohn, Xudong Yuan:
i?(1)-perfect graphs with girth at least six. Ars Comb. 87 (2008) - Irene Stella, Lutz Volkmann, Stefan Winzen:
How close to regular must a multipartite tournament be to secure a given path covering number? Ars Comb. 87 (2008) - Jun-Ming Xu, Min Lu:
Restricted Edge-Connectivity of de Bruijn Digraphs. Ars Comb. 87 (2008) - Landang Yuan, Qingde Kang:
Graph designs for eight graphs with six vertices and eight edges (index >1). Ars Comb. 87 (2008) - Zan-Bo Zhang, Dingjun Lou, Xiaoyan Zhang:
Notes on factor-critically, extendability and independence number. Ars Comb. 87 (2008) - Zhongfu Zhang, Pengxiang Qiu, Baogen Xu, Jingwen Li, Xiangen Chen, Bing Yao:
Vertex-distinguishing total coloring of graphs. Ars Comb. 87 (2008)
skipping 2 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-10-18 17:00 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