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 76 matches
- 2020
- Nair Abreu, Jorge Alencar, André Ebling Brondani, Leonardo Silva de Lima, Carla Silva Oliveira:
Graphs with all but two eigenvalues in [-2, 0]. Discuss. Math. Graph Theory 40(2): 379-391 (2020) - Saieed Akbari, Soudabeh Dalvandi, Farideh Heydari, Mohammad Maghasedi:
Signed complete graphs with maximum index. Discuss. Math. Graph Theory 40(2): 393-403 (2020) - Saeid Alikhani, Sandi Klavzar, Florian Lehner, Samaneh Soltani:
Trees with distinguishing index equal distinguishing number plus one. Discuss. Math. Graph Theory 40(3): 875-884 (2020) - David Amos, John Asplund, Boris Brimkov, Randy Davila:
The Slater and sub-k-domination number of a graph with applications to domination and k-domination. Discuss. Math. Graph Theory 40(1): 209-225 (2020) - Nawarat Ananchuen, Pawaton Kaemawichanurat:
Connected domination critical graphs with cut vertices. Discuss. Math. Graph Theory 40(4): 1035-1055 (2020) - Milica Andelic, Francesco Belardo, Zoran Stanic:
Preface. Discuss. Math. Graph Theory 40(2): 365-366 (2020) - Milica Andelic, Tamara Koledin, Zoran Stanic:
On regular signed graphs with three eigenvalues. Discuss. Math. Graph Theory 40(2): 405-416 (2020) - Andrew Arokiaraj, Sandi Klavzar, Paul D. Manuel, Elizabeth Thomas, Antony Xavier:
Strong geodetic problems in networks. Discuss. Math. Graph Theory 40(1): 307-321 (2020) - Faraha Ashraf, Martin Baca, Susana-Clara López, Francesc Antoni Muntaner-Batle, Akito Oshima, Andrea Semanicová-Fenovcíková:
On total H-irregularity strength of the disjoint union of graphs. Discuss. Math. Graph Theory 40(1): 181-194 (2020) - Olivier Baudon, Hervé Hocquard, Antoni Marczyk, Monika Pilsniak, Jakub Przybylo, Mariusz Wozniak:
On a total version of 1-2-3 Conjecture. Discuss. Math. Graph Theory 40(4): 1175-1186 (2020) - Francesco Belardo, Maurizio Brunetti, Nathan Reff:
Balancedness and the least Laplacian eigenvalue of some complex unit gain graphs. Discuss. Math. Graph Theory 40(2): 417-433 (2020) - Francesco Belardo, Xiaogang Liu, Jianfeng Wang, Jing Wang:
Graphs whose Aα radius does not exceed 2. Discuss. Math. Graph Theory 40(2): 677-690 (2020) - Anton Bernshteyn, Omid Khormali, Ryan R. Martin, Jonathan Rollin, Danny Rorabaugh, Songling Shan, Andrew J. Uzzell:
Regular colorings in regular graphs. Discuss. Math. Graph Theory 40(3): 795-806 (2020) - Mostafa Blidia, Ahmed Bouchou, Mustapha Chellali:
Extremal graphs for a bound on the Roman domination number. Discuss. Math. Graph Theory 40(3): 771-785 (2020) - Zbigniew R. Bogdanowicz:
On the minimum number of spanning trees in cubic multigraphs. Discuss. Math. Graph Theory 40(1): 149-159 (2020) - Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova:
Low 5-stars at 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 7 to 9. Discuss. Math. Graph Theory 40(4): 1025-1033 (2020) - Oleg V. Borodin, Anna O. Ivanova, Ekaterina I. Vasil'eva:
Light minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. Discuss. Math. Graph Theory 40(4): 985-994 (2020) - Mieczyslaw Borowiecki, Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Graph classes generated by Mycielskians. Discuss. Math. Graph Theory 40(4): 1163-1173 (2020) - Axel Brandt, Sogol Jahanbekam, Jennifer White:
Additive list coloring of planar graphs with given girth. Discuss. Math. Graph Theory 40(3): 855-873 (2020) - Bostjan Bresar, Jasmina Ferme, Sandi Klavzar, Douglas F. Rall:
A survey on packing colorings. Discuss. Math. Graph Theory 40(4): 923-970 (2020) - Johann A. Briffa, Irene Sciriha:
On the displacement of eigenvalues when removing a twin vertex. Discuss. Math. Graph Theory 40(2): 435-450 (2020) - Izak Broere, Johannes Heidema, Stefan Veldsman:
Congruences and Hoehnke radicals on graphs. Discuss. Math. Graph Theory 40(4): 1067-1084 (2020) - Domingos M. Cardoso, Germain Pastén, Oscar Rojo:
Graphs with clusters perturbed by regular graphs - Aα-spectrum and applications. Discuss. Math. Graph Theory 40(2): 451-466 (2020) - Zhen-Chun Chen, Hung-Chih Lee:
Decomposing the complete graph into Hamiltonian paths (cycles) and 3-stars. Discuss. Math. Graph Theory 40(3): 823-839 (2020) - Eddie Cheng, Lih-Hsing Hsu, Chun-Nan Hung, Meng-Chien Yang:
2-spanning cyclability problems of the some generalized Petersen graphs. Discuss. Math. Graph Theory 40(3): 713-731 (2020) - Sebastian M. Cioaba, Randall J. Elzinga, David A. Gregory:
Some observations on the smallest adjacency eigenvalue of a graph. Discuss. Math. Graph Theory 40(2): 467-493 (2020) - Vincent E. Coll, Jonelle Hook, Colton Magnant, Karen McCready, Kathleen Ryan:
The proper diameter of a graph. Discuss. Math. Graph Theory 40(1): 107-125 (2020) - Dragos M. Cvetkovic, Peter Rowlinson:
Slobodan Simić: an appreciaton. Discuss. Math. Graph Theory 40(2): 367-378 (2020) - Kennteth Dadedzi, Valisoa Razanajatovo Misanantenaina, Stephan G. Wagner:
On the distance spectral radius of trees with given degree sequence. Discuss. Math. Graph Theory 40(2): 495-524 (2020) - Randy Davila, Michael A. Henning:
Total forcing sets and zero forcing sets in trees. Discuss. Math. Graph Theory 40(3): 733-754 (2020)
skipping 46 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-03 04:02 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