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 32 matches
- 2012
- Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of 2-degenerate graphs. J. Graph Theory 69(1): 1-27 (2012) - Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski:
Extremal graphs having no matching cuts. J. Graph Theory 69(2): 206-222 (2012) - Julia Böttcher, Jan Hladký, Diana Piguet:
The tripartite Ramsey number for trees. J. Graph Theory 69(3): 264-300 (2012) - Debra L. Boutin, Sally Cockburn:
Geometric graph homomorphisms. J. Graph Theory 69(2): 97-113 (2012) - Bostjan Bresar, Paul Dorbec, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. J. Graph Theory 69(1): 46-76 (2012) - Fan R. K. Chung, Paul Horn, Linyuan Lu:
Diameter of random spanning trees in a given graph. J. Graph Theory 69(3): 223-240 (2012) - Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu:
A Planar linear arboricity conjecture. J. Graph Theory 69(4): 403-425 (2012) - Amit Daniely, Nathan Linial:
Tight products and graph expansion. J. Graph Theory 69(4): 426-440 (2012) - Alice Devillers, Michael Giudici, Cai Heng Li, Cheryl E. Praeger:
Locally s-distance transitive graphs. J. Graph Theory 69(2): 176-197 (2012) - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Distributing vertices on Hamiltonian cycles. J. Graph Theory 69(1): 28-45 (2012) - Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto:
Claw-free graphs and 2-factors that separate independent vertices. J. Graph Theory 69(3): 251-263 (2012) - Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Variations on cops and robbers. J. Graph Theory 69(4): 383-402 (2012) - Mike J. Grannell, Martin Knor:
On the number of triangular embeddings of complete graphs and complete tripartite graphs. J. Graph Theory 69(4): 370-382 (2012) - Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer:
Closures, cycles, and paths. J. Graph Theory 69(3): 314-323 (2012) - Penny Haxell, Jessica McDonald:
On characterizing Vizing's edge colouring bound. J. Graph Theory 69(2): 160-168 (2012) - Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang:
Group connectivity of complementary graphs. J. Graph Theory 69(4): 464-470 (2012) - Sandi Klavzar, Sergey V. Shpectorov:
Convex excess in partial cubes. J. Graph Theory 69(4): 356-369 (2012) - István Kovács, Bostjan Kuzman, Aleksander Malnic, Steve Wilson:
Characterization of edge-transitive 4-valent bicirculants. J. Graph Theory 69(4): 441-463 (2012) - Daniel Král', Petr Skoda, Jan Volec:
Domination number of cubic graphs with large girth. J. Graph Theory 69(2): 131-142 (2012) - Klavdija Kutnar, Dragan Marusic, Cui Zhang:
On cubic non-Cayley vertex-transitive graphs. J. Graph Theory 69(1): 77-95 (2012) - Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. J. Graph Theory 69(3): 241-250 (2012) - Hongliang Lu:
Regular Graphs, Eigenvalues and Regular Factors. J. Graph Theory 69(4): 349-355 (2012) - Tomasz Luczak, Miklós Simonovits, Jozef Skokan:
On the multi-colored Ramsey numbers of cycles. J. Graph Theory 69(2): 169-175 (2012) - Jun Ma, Yeong-Nan Yeh:
Combinatorial interpretations for TG(1, -1). J. Graph Theory 69(3): 341-348 (2012) - Wolfgang Mader:
Connectivity keeping trees in k-connected graphs. J. Graph Theory 69(3): 324-329 (2012) - Atsuhiro Nakamoto, Kenta Ozeki:
Hamiltonian cycles in bipartite quadrangulations on the torus. J. Graph Theory 69(2): 143-151 (2012) - Atsuhiro Nakamoto, Yusuke Suzuki:
Y-rotation in k-minimal quadrangulations on the projective plane. J. Graph Theory 69(3): 301-313 (2012) - Konstantinos Panagiotou, Makrand Sinha:
Vertices of degree k in random unlabeled trees. J. Graph Theory 69(2): 114-130 (2012) - Nathalie Paul, Claude Tardif:
The chromatic Ramsey number of odd wheels. J. Graph Theory 69(2): 198-205 (2012) - R. Bruce Richter, Jozef Sirán, Yan Wang:
Self-dual and self-petrie-dual regular maps. J. Graph Theory 69(2): 152-159 (2012)
skipping 2 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 2025-01-03 21:17 CET 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