![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
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 26 matches
- 2010
- Michael O. Albertson, Hannah Alpert, sarah-marie belcastro
, Ruth Haas
:
Grünbaum colorings of toroidal triangulations. J. Graph Theory 63(1): 68-81 (2010) - Barry Balof, Christopher Storm:
Constructing isospectral non-isomorphic digraphs from hypergraphs. J. Graph Theory 63(3): 231-242 (2010) - Manu Basavaraju, L. Sunil Chandran, Manoj Kummini:
d-Regular graphs of acyclic chromatic index at least d+2. J. Graph Theory 63(3): 226-230 (2010) - Andrew Bowler, Paul Brown, Trevor I. Fenner:
Families of pairs of graphs with a large number of common cards. J. Graph Theory 63(2): 146-163 (2010) - Jason I. Brown, Richard Hoshino:
Proof of a conjecture on fractional Ramsey numbers. J. Graph Theory 63(2): 164-178 (2010) - Maria Chudnovsky
, Alexandra Ovetsky Fradkin:
An approximate version of Hadwiger's conjecture for claw-free graphs. J. Graph Theory 63(4): 259-278 (2010) - Kinkar Chandra Das, Sang-Gu Lee
, Gi-Sang Cheon
:
On the conjecture for certain Laplacian integral spectrum of graphs. J. Graph Theory 63(2): 106-113 (2010) - Zdenek Dvorák
, Daniel Král'
, Riste Skrekovski
:
Non-rainbow colorings of 3-, 4- and 5-connected plane graphs. J. Graph Theory 63(2): 129-145 (2010) - Odile Favaron, François Genest, Mekkia Kouider:
Regular path decompositions of odd regular graphs. J. Graph Theory 63(2): 114-128 (2010) - Marina Groshaus, Jayme Luiz Szwarcfiter:
Biclique graphs and biclique matrices. J. Graph Theory 63(1): 1-16 (2010) - András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Monochromatic Hamiltonian 3-tight Berge cycles in 2-colored 4-uniform hypergraphs. J. Graph Theory 63(4): 288-299 (2010) - Andreas Holtkamp, Lutz Volkmann:
On local connectivity of graphs with given clique number. J. Graph Theory 63(3): 192-197 (2010) - Tatsuya Honjo, Ken-ichi Kawarabayashi, Atsuhiro Nakamoto
:
Dominating sets in triangulations on surfaces. J. Graph Theory 63(1): 17-30 (2010) - Vladimir P. Korzhik:
Finite fields and the 1-chromatic number of orientable surfaces. J. Graph Theory 63(3): 179-184 (2010) - Michael Krivelevich, Raphael Yuster:
The rainbow connection of a graph is (at most) reciprocal to its minimum degree. J. Graph Theory 63(3): 185-191 (2010) - André Kündgen
, Craig Timmons:
Star coloring planar graphs from small lists. J. Graph Theory 63(4): 324-337 (2010) - Wensong Lin, Daphne Der-Fen Liu, Xuding Zhu:
Multi-coloring the Mycielskian of graphs. J. Graph Theory 63(4): 311-323 (2010) - Wolfgang Mader:
Existence of openly disjoint circuits through a vertex. J. Graph Theory 63(2): 93-105 (2010) - Dirk Meierling:
Solution of a conjecture of Tewes and Volkmann regarding extendable cycles in in-tournaments. J. Graph Theory 63(1): 82-92 (2010) - Jaroslav Nesetril
, Claude Tardif:
Path homomorphisms, graph colorings, and boolean matrices. J. Graph Theory 63(3): 198-209 (2010) - Jia Shen:
Subgraph-avoiding coloring of graphs. J. Graph Theory 63(4): 300-310 (2010) - Nicolas Trotignon, Kristina Vuskovic:
A structure theorem for graphs with no cycle with a unique chord and its consequences. J. Graph Theory 63(1): 31-67 (2010) - Ruixia Wang, Aimin Yang, Shiying Wang:
Kings in locally semicomplete digraphs. J. Graph Theory 63(4): 279-287 (2010) - Manuel Welhan:
Reconstructing trees from two cards. J. Graph Theory 63(3): 243-257 (2010) - Baogang Xu, Juan Yan, Xingxing Yu:
Balanced judicious bipartitions of graphs. J. Graph Theory 63(3): 210-225 (2010) - Jed Yang:
Vertex-pancyclicity of hypertournaments. J. Graph Theory 63(4): 338-348 (2010)
loading more results
failed to load more results, please try again later
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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-07-12 00:54 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