default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSearch 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 117 matches
- 2023
- Joseph Briggs, Dean Hoffman, Sarah Heuss Holliday, Peter D. Johnson Jr.:
Self-colorings of graphs. Bull. ICA 97: 106-116 (2023) - Jonathan Calzadillas, Dan McQuillan:
Vertex-magic trees with n central vertices and kn leaves have bounded order for each k exceeding the square root of 3. Bull. ICA 97: 117-127 (2023) - John M. Campbell:
A proof via Zeilberger's algorithm of Boole's formula for factorials. Bull. ICA 97: 47-53 (2023) - Péter Hajnal:
A short note on Zeckendorf type numeration systems with negative digits allowed. Bull. ICA 97: 54-66 (2023) - Doost Ali Mojdeh, Babak Samadi, Ismael G. Yero:
Global offensive k-alliances in digraphs. Bull. ICA 97: 67-82 (2023) - Shyam Saurabh, Kishore Sinha:
Matrix approaches to constructions of group divisible designs. Bull. ICA 97: 83-105 (2023) - 2022
- Marién Abreu, Domenico Labbate, Federico Romaniello, John Sheehan:
Even orientations and pfaffian graphs. Bull. ICA 95: 70-83 (2022) - Daniel M. Banegas, Bryan J. Freyberg:
Distance quasi-magic regular graphs and some applications. Bull. ICA 96: 68-83 (2022) - Alexis Byers, Anita O'Mellan:
An amalgamation of graceful and harmonious labelings. Bull. ICA 96: 53-67 (2022) - Dean Crnkovic, Sanja Rukavina:
New symmetric 2-(71, 15, 3) designs. Bull. ICA 94: 79-94 (2022) - Shibsankar Das, Shikha Rai:
Degree-based topological descriptors of type 3 rectangular hex-derived networks. Bull. ICA 95: 21-37 (2022) - Bryan J. Freyberg:
Corrigendum: Face-magic labelings of type (a, b, c) from edge-magic labelings of type (α, β). Bull. ICA 94: 71-72 (2022) - David Hu, Alec Sun:
Probabilistic zero forcing on grid, regular, and hypercube graphs. Bull. ICA 96: 119-133 (2022) - Cong X. Kang, Eunjeong Yi:
Distance-k locating-dominating sets in graphs. Bull. ICA 95: 38-56 (2022) - K. M. Kathiresan, S. Muthumari, R. Ramalakshmi:
Edge odd graceful labelings of certain new classes of graphs. Bull. ICA 95: 57-69 (2022) - Martin Kreh, Jan-Hendrik de Wiljes:
Peg solitaire on corona products. Bull. ICA 96: 107-118 (2022) - Lucas Mol, Ortrud R. Oellermann, Vibhav Oswal:
On the average (edge-)connectivity of minimally k-(edge-)connected graphs. Bull. ICA 94: 95-110 (2022) - Emanuele Munarini:
A note on a definite integral of combinatorial interest. Bull. ICA 94: 35-52 (2022) - R. Sampathkumar, T. Sivakaran:
4t-cycle decomposition of the 2-fold tensor product Km×Kn(2). Bull. ICA 96: 84-106 (2022) - Dinesh G. Sarvate, Pramod N. Shinde:
Missing blocks of two designs in Hanani's paper. Bull. ICA 94: 73-78 (2022) - Shyam Saurabh, Kishore Sinha:
Some matrix constructions of L2-type Latin square designs. Bull. ICA 95: 93-104 (2022) - Michela J. Stinson, Douglas R. Stinson:
An analysis and critique of the scoring method used for sport climbing at the 2020 Tokyo Olympics. Bull. ICA 94: 13-34 (2022) - Divya K. Udayan, K. Somasundaram:
Permanent dominance conjecture for derived partitions. Bull. ICA 95: 84-92 (2022) - Adrián Vázquez-Ávila:
A note on the Buratti-Horak-Rosa conjecture about hamiltonian paths in complete graphs. Bull. ICA 94: 53-70 (2022) - 2021
- Peter Adams, Ryan C. Bunge, Roger B. Eggleton, Saad I. El-Zanati, Ugur Odabasi, Wannasiri Wannasit:
Decompositions of complete graphs and complete bipartite graphs into bipartite cubic graphs of order at most 12. Bull. ICA 92: 50-61 (2021) - Brian Alspach:
Honeycomb Toroidal Graphs. Bull. ICA 91: 94-114 (2021) - Jingjun Bao, Marco Buratti, Lijin Ji:
A note on almost partitioned difference families. Bull. ICA 93: 45-51 (2021) - Robert A. Beeler, Aaron D. Gray:
Double jump peg solitaire on graphs. Bull. ICA 91: 80-93 (2021) - Robert Brier, Darryn E. Bryant:
On the Steiner Quadruple System with Ten Points. Bull. ICA 91: 115-127 (2021) - Braxton Carrigan, James M. Hammer, John Lorch, Robert Lorch, Caitlin Owens:
List colorings count rokudoku-pair squares. Bull. ICA 92: 62-77 (2021)
skipping 87 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 2025-01-06 05:57 CET 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
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
