default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches

• 

Venues:

• no matches

• 

Publications:

• no matches

• 

ask others

• Google
• Google Scholar
• Semantic Scholar
• Internet Archive Scholar
• CiteSeerX
• ORCID

Refine list

refinements active!

zoomed in on ?? of ?? records

dismiss all constraints

view refined list in

dblp search

export refined list as

XML

JSON

JSONP

BibTeX

showing all ?? records

Editorial

• 
  Dragan Marusic, Tomaz Pisanski:
  The ADAM graph and its configuration. #E1.01

Articles

• 
  Yaping Mao, Eddie Cheng, Zhao Wang, Zhiwei Guo:
  The k-independence number of graph products. #P1.01
• 
  Jürgen Bokowski, Michael Cuntz:
  Hurwitz's regular map (3, 7) of genus 7: A polyhedral realization. #P1.02
• 
  Alexander Reich:
  Classification of robust cycle bases and relations to fundamental cycle bases. #P1.03
• 
  Dave Witte Morris:
  Cayley graphs on groups with commutator subgroup of order 2p are hamiltonian. #P1.04
• 
  Joy Morris, Josh Tymburski:
  Most rigid representations and Cayley index. #P1.05
• 
  Chun-Nan Hung, Tao-Ming Wang, Lih-Hsing Hsu, Eddie Cheng:
  Fault-Hamiltonicity of Cartesian products of directed cycles. #P1.06
• 
  Luis Manuel Rivera, Ana Laura Trujillo-Negrete:
  Hamiltonicity of token graphs of fan graphs. #P1.07
• 
  Marc Hellmuth, Yangjing Long, Manuela Geiß, Peter F. Stadler:
  A short note on undirected Fitch graphs. #P1.08
• 
  Martin Knor, Katarína Hrináková, Riste Skrekovski:
  On a conjecture about the ratio of Wiener index in iterated line graphs. #P1.09
• 
  Yarong Wei, Yumei Hu:
  The number of independent sets in a connected graph and its complement. #P1.10

Announcements, News, Photos

• 
  Asia Ivic Weiss, Eva Marie Stehle:
  Norman W. Johnson (12 November 1930 to 13 July 2017). #N1.01
• 
  Bostjan Bresar, Sandi Klavzar:
  Professor Wilfried Imrich awarded honorary doctorate at the University of Maribor. #N1.02
• 
  Yan-Quan Feng, Thomas W. Tucker:
  Special Issue of ADAM on Symmetries of Graphs and Networks – Call for Papers. #N1.03

Editorial

• 
  Francesco Belardo:
  The International Congress on Hypergraphs, Graphs and Designs – HyGraDe 2017. #E2.01

Hypergraphs, Graphs and Designs

• 
  Richard A. Brualdi, Michael W. Schroeder:
  Circulant matrices and mathematical juggling. #P2.01
• 
  Marco Buratti:
  On silver and golden optical orthogonal codes. #P2.02
• 
  Charles J. Colbourn, Erin Lanus:
  Subspace restrictions and affine composition for covering perfect hash families. #P2.03
• 
  Mariusz Meszka, Alexander Rosa:
  Reaction graphs of double Fano planes. #P2.04
• 
  Zsolt Tuza:
  Mixed hypergraphs and beyond. #P2.05
• 
  Vitaly Voloshin:
  Mario Gionfriddo and mixed hypergraph coloring. #P2.06
• 
  Marién Abreu, Gabriela Araujo-Pardo, Camino Balbuena, Domenico Labbate:
  An alternate description of a (q + 1, 8)-cage. #P2.07
• 
  Paola Bonacini, Mario Gionfriddo, Lucia Marino:
  Perfect blocking sets in P3-designs. #P2.08
• 
  Maria Di Giovanni, Mario Gionfriddo, Antoinette Tripodi:
  Parallelism in Steiner systems. #P2.09
• 
  Francesco Belardo, Sebastian M. Cioaba, Jack H. Koolen, Jianfeng Wang:
  Open problems in the spectral theory of signed graphs. #P2.10

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).

load links from unpaywall.org

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).

load content from archive.org

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 .

load data from openalex.org

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.

last updated on 2025-12-04 01:27 CET 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: