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 31 matches
- 2012
- M. Amin Bahmanian, C. A. Rodger:
Multiply balanced edge colorings of multigraphs. J. Graph Theory 70(3): 297-317 (2012) - Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Long cycles in subgraphs of (pseudo)random directed graphs. J. Graph Theory 70(3): 284-296 (2012) - Robert Berke, Penny E. Haxell, Tibor Szabó:
Bounded transversals in multipartite graphs. J. Graph Theory 70(3): 318-331 (2012) - Béla Bollobás, Mykhaylo Tyomkyn:
Walks and paths in trees. J. Graph Theory 70(1): 54-66 (2012) - Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West:
Packing of graphic n-tuples. J. Graph Theory 70(1): 29-39 (2012) - Albert Bush, Yi Zhao:
Minimum degree thresholds for bipartite graph tiling. J. Graph Theory 70(1): 92-120 (2012) - Min Chen, André Raspaud:
A sufficient condition for planar graphs to be acyclically 5-choosable. J. Graph Theory 70(2): 135-151 (2012) - Maria Chudnovsky, Yori Zwols:
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement. J. Graph Theory 70(4): 449-472 (2012) - Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West:
Overlap number of graphs. J. Graph Theory 70(1): 10-28 (2012) - Peter Dankelmann, David Erwin, Simon Mukwembi, Bernardo Gabriel Rodrigues, Eric C. Mwambene, Gert Sabidussi:
Automorphism group and diameter of a graph. J. Graph Theory 70(1): 80-91 (2012) - Italo J. Dejter:
From the Coxeter Graph to the Klein Graph. J. Graph Theory 70(1): 1-9 (2012) - Feng Ming Dong, Khee Meng Koh:
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. J. Graph Theory 70(3): 262-283 (2012) - Mark N. Ellingham, Michael D. Plummer, Gexin Yu:
Linkage for the diamond and the path with four vertices. J. Graph Theory 70(3): 241-261 (2012) - Jun Fujisawa, Katsuhiro Ota:
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs. J. Graph Theory 70(1): 40-53 (2012) - Shinya Fujita, Colton Magnant:
Extensions of Gallai-Ramsey results. J. Graph Theory 70(4): 404-426 (2012) - Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Integral trees of odd diameters. J. Graph Theory 70(3): 332-338 (2012) - Terry S. Griggs, Jozef Sirán, R. Bruce Richter:
Graphs obtained from Moufang loops and regular maps. J. Graph Theory 70(4): 427-434 (2012) - Ryo Hanaki:
On strongly almost trivial embeddings of graphs. J. Graph Theory 70(1): 67-79 (2012) - István Kovács, Mary Servatius:
On Cayley digraphs on nonisomorphic 2-groups. J. Graph Theory 70(4): 435-448 (2012) - Choongbum Lee, Joonkyung Lee, Sang-il Oum:
Rank-width of random graphs. J. Graph Theory 70(3): 339-347 (2012) - László Lovász, Balázs Szegedy:
Random graphons and a weak Positivstellensatz for graphs. J. Graph Theory 70(2): 214-225 (2012) - John Maharry, Daniel C. Slilaty:
Projective-Planar Graphs with No K3, 4-Minor. J. Graph Theory 70(2): 121-134 (2012) - Jessica McDonald, Bojan Mohar, Diego Scheide:
Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. J. Graph Theory 70(2): 226-239 (2012) - Stefko Miklavic, Primoz Sparl:
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups. J. Graph Theory 70(4): 384-403 (2012) - Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Δ-edge-colorable subgraphs of class II graphs. J. Graph Theory 70(4): 473-482 (2012) - Dhruv Mubayi:
Books Versus triangles. J. Graph Theory 70(2): 171-179 (2012) - Lydia Ostermeier, Marc Hellmuth, Peter F. Stadler:
The Cartesian product of hypergraphs. J. Graph Theory 70(2): 180-196 (2012) - Sergey V. Savchenko:
Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d. J. Graph Theory 70(4): 361-383 (2012) - Xiuyun Wang, Yan-Quan Feng:
Tetravalent half-edge-transitive graphs and non-normal Cayley graphs. J. Graph Theory 70(2): 197-213 (2012) - Tsai-Lien Wong, Xuding Zhu:
Antimagic labelling of vertex weighted graphs. J. Graph Theory 70(3): 348-350 (2012)
skipping 1 more match
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-11-12 03:26 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