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 168 matches
- 2021
- M. H. Bani Mostafa A., Ebrahim Ghorbani:
Hamiltonicity of a Coprime Graph. Graphs Comb. 37(6): 2387-2395 (2021) - Kanat S. Abdukhalikov, Duy Ho:
Polar Coordinates View on KM-Arcs. Graphs Comb. 37(5): 1467-1490 (2021) - Sinan G. Aksoy, Mark Kempton, Stephen J. Young:
Spectral Threshold for Extremal Cyclic Edge-Connectivity. Graphs Comb. 37(6): 2079-2093 (2021) - Robert E. L. Aldred, Jun Fujisawa, Akira Saito:
Distance Matching Extension in Cubic Bipartite Graphs. Graphs Comb. 37(5): 1793-1806 (2021) - Mansour J. Algefari, Hong-Jian Lai:
Supereulerian Graphs with Constraints on the Matching Number and Minimum Degree. Graphs Comb. 37(1): 55-64 (2021) - Javier Alonso, Pedro Martín:
Maximum Spanning Trees in Normed Planes. Graphs Comb. 37(4): 1385-1403 (2021) - Hannah Alpert, Érika Roldán:
Art Gallery Problem with Rook and Queen Vision. Graphs Comb. 37(2): 621-642 (2021) - Sarah E. Anderson, Kirsti Kuenzel, Douglas F. Rall:
On Well-Dominated Graphs. Graphs Comb. 37(1): 151-165 (2021) - Kiyoshi Ando, Yoshimi Egawa:
Contractible Edges and Contractible Triangles in a 3-Connected Graph. Graphs Comb. 37(5): 1807-1821 (2021) - Gabriela Araujo-Pardo, György Kiss, Christian Rubio-Montiel, Adrián Vázquez-Ávila:
On Line Colorings of Finite Projective Spaces. Graphs Comb. 37(3): 891-905 (2021) - Ali Aubad, Peter Rowley:
Commuting Involution Graphs for Certain Exceptional Groups of Lie Type. Graphs Comb. 37(4): 1345-1355 (2021) - Ammar Babikir, Magda Dettlaff, Michael A. Henning, Magdalena Lemanska:
Independent Domination Subdivision in Graphs. Graphs Comb. 37(3): 691-709 (2021) - Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
On Supereulerian 2-Edge-Coloured Graphs. Graphs Comb. 37(6): 2601-2620 (2021) - Houmem Belkhechine, Cherifa Ben Salha:
Making a Tournament Indecomposable by One Subtournament-Reversal Operation. Graphs Comb. 37(3): 823-838 (2021) - Thomas Bellitto, Tereza Klimosová, Martin Merker, Marcin Witkowski, Yelena Yuditsky:
Counterexamples to Thomassen's Conjecture on Decomposition of Cubic Graphs. Graphs Comb. 37(6): 2595-2599 (2021) - Julien Bensmail, Fionn Mc Inerney:
On Generalisations of the AVD Conjecture to Digraphs. Graphs Comb. 37(2): 545-558 (2021) - Julien Bensmail, Bi Li, Binlong Li:
An Injective Version of the 1-2-3 Conjecture. Graphs Comb. 37(1): 281-311 (2021) - Sudip Bera, Hiranya Kishore Dey, Sajal Kumar Mukherjee:
On the Connectivity of Enhanced Power Graphs of Finite Groups. Graphs Comb. 37(2): 591-603 (2021) - Kassahun Betre, Evatt Salinger:
The Inductive Graph Dimension from the Minimum Edge Clique Cover. Graphs Comb. 37(6): 2637-2654 (2021) - Allan Bickle, Zhongyuan Che:
Wiener Indices of Maximal k-Degenerate Graphs. Graphs Comb. 37(2): 581-589 (2021) - Mohammadreza Bidgoli, Ali Mohammadian, Behruz Tayfeh-Rezaie:
On K2, t-Bootstrap Percolation. Graphs Comb. 37(3): 731-741 (2021) - Owen Biesel:
A Principle for Converting Lindström-Type Lemmas to Stembridge-Type Theorems, with Applications to Walks, Groves, and Alternating Flows. Graphs Comb. 37(4): 1229-1246 (2021) - Ravil Bildanov, Viktor Panshin, Grigory Ryabov:
On WL-Rank and WL-Dimension of Some Deza Circulant Graphs. Graphs Comb. 37(6): 2397-2421 (2021) - Anthony Bonato, Sean English, Bill Kay, Daniel Moghbel:
Improved Bounds for Burning Fence Graphs. Graphs Comb. 37(6): 2761-2773 (2021) - Márton Borbényi, Péter Csikvári, Haoran Luo:
On the Number of Forests and Connected Spanning Subgraphs. Graphs Comb. 37(6): 2655-2678 (2021) - Abderrahim Boussaïri, Brahim Chergui, Pierre Ille, Mohamed Zaidi:
Prime 3-Uniform Hypergraphs. Graphs Comb. 37(6): 2737-2760 (2021) - Christoph Brause, Stanislav Jendrol', Ingo Schiermeyer:
From Colourful to Rainbow Paths in Graphs: Colouring the Vertices. Graphs Comb. 37(5): 1823-1839 (2021) - Mengyue Cao, Jack H. Koolen, Akihiro Munemasa, Kiyoto Yoshino:
Maximality of Seidel matrices and switching roots of graphs. Graphs Comb. 37(5): 1491-1507 (2021) - Jie Cao, Lily Li Liu:
The Eulerian Distribution on the Involutions of the Hyperoctahedral Group is Indeed γ-Positive. Graphs Comb. 37(6): 1943-1951 (2021) - Fei-Huang Chang, Hong-Bin Chen, Wei-Tian Li, Zhishi Pan:
Shifted-Antimagic Labelings for Graphs. Graphs Comb. 37(3): 1065-1082 (2021)
skipping 138 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-15 07:42 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