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 55 matches
- 2011
- Ghidewon Abay-Asmerom, Richard H. Hammack, Craig E. Larson, Dewey T. Taylor:
Notes on the independence number in the Cartesian product of graphs. Discuss. Math. Graph Theory 31(1): 25-35 (2011) - Mais Alkhateeb, Anja Kohl:
Upper bounds on the b-chromatic number and results for restricted graph classes. Discuss. Math. Graph Theory 31(4): 709-735 (2011) - N. R. Aravind, N. Narayanan, C. R. Subramanian:
Oriented colouring of some graph products. Discuss. Math. Graph Theory 31(4): 675-686 (2011) - József Balogh, John Lenz, Hehui Wu:
Complete minors, independent sets, and chordal graphs. Discuss. Math. Graph Theory 31(4): 639-674 (2011) - Mostafa Blidia, Widad Dali:
A characterization of locating-total domination edge critical graphs. Discuss. Math. Graph Theory 31(1): 197-202 (2011) - Piotr Borowiecki, Kristína Budajová, Stanislav Jendrol', Stanislav Krajci:
Parity vertex colouring of graphs. Discuss. Math. Graph Theory 31(1): 183-195 (2011) - Piotr Borowiecki, Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
Preface. Discuss. Math. Graph Theory 31(2): 207 (2011) - Mieczyslaw Borowiecki, Arnfried Kemnitz, Massimiliano Marangio, Peter Mihók:
Generalized total colorings of graphs. Discuss. Math. Graph Theory 31(2): 209-222 (2011) - Y. M. Borse, Kiran Dalvi, M. M. Shikare:
Forbidden-minor characterization for the class of cographic element splitting matroids. Discuss. Math. Graph Theory 31(3): 601-606 (2011) - Andrew Breiner, Jitender S. Deogun, Pierre Ille:
Decomposition tree and indecomposable coverings. Discuss. Math. Graph Theory 31(1): 37-44 (2011) - Yuehua Bu, Ko-Wei Lih, Weifan Wang:
Adjacent vertex distinguishing edge-colorings of planar graphs with girth at least six. Discuss. Math. Graph Theory 31(3): 429-439 (2011) - Csilla Bujtás, Zsolt Tuza, Vitaly I. Voloshin:
Color-bounded hypergraphs, V: host graphs and subdivisions. Discuss. Math. Graph Theory 31(2): 223-238 (2011) - Grady Bullington, Linda Eroh, Ralucca Gera, Steven J. Winters:
Closed k-stop distance in graphs. Discuss. Math. Graph Theory 31(3): 533-545 (2011) - Mustapha Chellali, Lutz Volkmann:
Characterization of trees with equal 2-domination number and domination number plus two. Discuss. Math. Graph Theory 31(4): 687-697 (2011) - Lane H. Clark, Darin Johnson:
The independent domination number of a random graph. Discuss. Math. Graph Theory 31(1): 129-142 (2011) - Július Czap, Stanislav Jendrol', Frantisek Kardos:
On strong parity chromatic number. Discuss. Math. Graph Theory 31(3): 587-600 (2011) - Pietra Delgado-Escalante, Hortensia Galeana-Sánchez:
On monochromatic paths and bicolored subdigraphs in arc-colored tournaments. Discuss. Math. Graph Theory 31(4): 791-820 (2011) - Klaus Dohmen:
An inductive proof of Whitney's Broken Circuit Theorem. Discuss. Math. Graph Theory 31(3): 509-515 (2011) - Lynne L. Doty:
Bounding neighbor-connectivity of Abelian Cayley graphs. Discuss. Math. Graph Theory 31(3): 475-491 (2011) - Emilia Drazenská, Marián Klesc:
On the crossing numbers of G\Box Cn for graphs G on six vertices. Discuss. Math. Graph Theory 31(2): 239-252 (2011) - Ramón M. Figueroa-Centeno, Rikio Ichishima, Francesc A. Muntaner-Batle, Akito Oshima:
A magical approach to some labeling conjectures. Discuss. Math. Graph Theory 31(1): 79-113 (2011) - Jean-Luc Fouquet, Jean-Marie Vanherpe:
On Fulkerson conjecture. Discuss. Math. Graph Theory 31(2): 253-272 (2011) - Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson:
γ-graphs of graphs. Discuss. Math. Graph Theory 31(3): 517-531 (2011) - Laura Frigerio, Federico Lastaria, Norma Zagaglia Salvi:
Adjacent vertex distinquishing edge colorings of the direct product of a regular graph by a path or cycle. Discuss. Math. Graph Theory 31(3): 547-557 (2011) - Jun Fujisawa, Akira Saito, Ingo Schiermeyer:
Closure for spanning trees and distant area. Discuss. Math. Graph Theory 31(1): 143-159 (2011) - Hortensia Galeana-Sánchez:
Kernels by monochromatic paths and the color-class digraph. Discuss. Math. Graph Theory 31(2): 273-281 (2011) - Hortensia Galeana-Sánchez, G. Gaytán-Gómez, Rocío Rojas-Monroy:
Monochromatic cycles and monochromatic paths in arc-colored digraphs. Discuss. Math. Graph Theory 31(2): 283-292 (2011) - Hortensia Galeana-Sánchez, César Hernández-Cruz:
Cyclically k-partite digraphs and k-kernels. Discuss. Math. Graph Theory 31(1): 63-78 (2011) - Hortensia Galeana-Sánchez, César Hernández-Cruz:
k-kernels in generalizations of transitive digraphs. Discuss. Math. Graph Theory 31(2): 293-312 (2011) - Pravin Garg, Deepa Sinha:
Some results on semi-total signed graphs. Discuss. Math. Graph Theory 31(4): 625-638 (2011)
skipping 25 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-04 09:52 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