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 121 matches
- 2014
- Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Bernardo Llano, Rita Zuazua:
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs. Graphs Comb. 30(4): 783-800 (2014) - Eyal Ackerman, Noa Nitzan, Rom Pinchasi:
The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges. Graphs Comb. 30(5): 1065-1072 (2014) - Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber:
Plane Graphs with Parity Constraints. Graphs Comb. 30(1): 47-69 (2014) - Saeed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr:
The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13. Graphs Comb. 30(4): 801-819 (2014) - Saieed Akbari, Mikio Kano:
{k, r - k}-Factors of r-Regular Graphs. Graphs Comb. 30(4): 821-826 (2014) - Richard P. Anstee, Christina Koch, Miguel Raggi, Attila Sali:
Forbidden Configurations and Product Constructions. Graphs Comb. 30(6): 1325-1349 (2014) - Dan Archdeacon:
Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs. Graphs Comb. 30(6): 1351-1361 (2014) - Dan Archdeacon, Terry S. Griggs, Costas Psomas:
Representing Graphs in Steiner Triple Systems. Graphs Comb. 30(2): 255-266 (2014) - Boris Aronov, Muriel Dulieu, Ferran Hurtado:
Witness Rectangle Graphs. Graphs Comb. 30(4): 827-846 (2014) - Maria Axenovich, JiHyeok Choi, Michelle A. Lastrina, Tracy McKay, J. Smith, Brendon Stanton:
On the Chromatic Number of Subsets of the Euclidean Plane. Graphs Comb. 30(1): 71-81 (2014) - Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze:
The t-Tone Chromatic Number of Random Graphs. Graphs Comb. 30(5): 1073-1086 (2014) - Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar:
b-Chromatic Number of Cartesian Product of Some Families of Graphs. Graphs Comb. 30(3): 511-520 (2014) - Ben Barber:
Maximum Hitting for n Sufficiently Large. Graphs Comb. 30(2): 267-274 (2014) - Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Jaroslaw Grytczuk, Grzegorz Matecki, Wiktor Zelazny:
Additive Coloring of Planar Graphs. Graphs Comb. 30(5): 1087-1098 (2014) - Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number and Radius. Graphs Comb. 30(2): 275-285 (2014) - Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy:
Rainbow Connection Number of Graph Power and Graph Products. Graphs Comb. 30(6): 1363-1382 (2014) - Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno:
3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected. Graphs Comb. 30(5): 1099-1122 (2014) - Adam Bohn:
Chromatic Polynomials of Complements of Bipartite Graphs. Graphs Comb. 30(2): 287-301 (2014) - Miklós Bóna:
On a Family of Conjectures of Joel Lewis on Alternating Permutations. Graphs Comb. 30(3): 521-526 (2014) - Flavia Bonomo, Mario Valencia-Pabon:
On the Minimum Sum Coloring of P 4-Sparse Graphs. Graphs Comb. 30(2): 303-314 (2014) - Isma Bouchemakh, Mohamed Zemir:
On the Broadcast Independence Number of Grid Graph. Graphs Comb. 30(1): 83-100 (2014) - Jason I. Brown, Ortrud R. Oellermann:
Graphs with a Minimal Number of Convex Sets. Graphs Comb. 30(6): 1383-1397 (2014) - Jason I. Brown, Julia Tufts:
On the Roots of Domination Polynomials. Graphs Comb. 30(3): 527-547 (2014) - Changjiang Bu, Jiang Zhou, Hongbo Li, Wenzhe Wang:
Spectral Characterizations of the Corona of a Cycle and Two Isolated Vertices. Graphs Comb. 30(5): 1123-1133 (2014) - Travis G. Buck, Anant P. Godbole:
Size-Maximal Symmetric Difference-Free Families of Subsets of [n]. Graphs Comb. 30(1): 101-108 (2014) - Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson:
A Degree Sequence Variant of Graph Ramsey Numbers. Graphs Comb. 30(4): 847-859 (2014) - Elena A. Caffarelli, Denise M. Halverson, Ryan J. Jensen:
The Steiner Problem on Surfaces of Revolution. Graphs Comb. 30(2): 315-342 (2014) - Pablo De Caria, Marisa Gutierrez:
Special Eccentric Vertices for the Class of Chordal Graphs and Related Classes. Graphs Comb. 30(2): 343-352 (2014) - Yair Caro, Michael A. Henning:
Simultaneous Domination in Graphs. Graphs Comb. 30(6): 1399-1416 (2014) - Shubo Chen, Weijun Liu:
Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges. Graphs Comb. 30(1): 109-118 (2014)
skipping 91 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-09-24 03:26 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