Остановите войну!
for scientists:
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 30 matches
- 2012
- Lars Døvling Andersen, Edita Mácajová, Ján Mazák:
Optimal acyclic edge-coloring of cubic graphs. J. Graph Theory 71(4): 353-364 (2012) - Michael D. Barrus, Douglas B. West:
The A4-structure of a graph. J. Graph Theory 71(2): 159-175 (2012) - Manu Basavaraju, L. Sunil Chandran:
Acyclic Edge Coloring of Triangle-Free Planar Graphs. J. Graph Theory 71(4): 365-385 (2012) - Douglas Bauer, Edward F. Schmeichel:
Binding Number, Minimum Degree, and Cycle Structure in Graphs. J. Graph Theory 71(2): 219-228 (2012) - Fabrício Siqueira Benevides:
A multipartite Ramsey number for odd cycles. J. Graph Theory 71(3): 293-316 (2012) - Eli Berger, Irith Ben-Arroyo Hartman:
A unified approach to known and unknown cases of Berge's conjecture. J. Graph Theory 71(3): 317-330 (2012) - Piotr Borowiecki, Frank Göring, Jochen Harant, Dieter Rautenbach:
The potential of greed for independence. J. Graph Theory 71(3): 245-259 (2012) - Richard C. Brewster, Daryl Funk:
On the hamiltonicity of line graphs of locally finite, 6-edge-connected graphs. J. Graph Theory 71(2): 182-191 (2012) - Victor A. Campos, András Gyárfás, Frédéric Havet, Cláudia Linhares Sales, Frédéric Maffray:
New Bounds on the Grundy Number of Products of Graphs. J. Graph Theory 71(1): 78-88 (2012) - L. Sunil Chandran, Anita Das, Deepak Rajendraprasad, Nithin M. Varma:
Rainbow connection number and connected dominating sets. J. Graph Theory 71(2): 206-218 (2012) - Maria Chudnovsky, Irena Penev, Alex Scott, Nicolas Trotignon:
Excluding Induced Subdivisions of the Bull and Related Graphs. J. Graph Theory 71(1): 49-68 (2012) - Daniel W. Cranston, Anja Pruchnewski, Zsolt Tuza, Margit Voigt:
List Colorings of K5-Minor-Free Graphs With Special List Assignments. J. Graph Theory 71(1): 18-30 (2012) - Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen:
New Ore-Type Conditions for H-Linked Graphs. J. Graph Theory 71(1): 69-77 (2012) - Michael Ferrara, Michael S. Jacobson, Kevin G. Milans, Craig Tennenhouse, Paul S. Wenger:
Saturation numbers for families of graph subdivisions. J. Graph Theory 71(4): 416-434 (2012) - Michael Ferrara, Timothy Morris, Paul S. Wenger:
Pancyclicity of 4-Connected, Claw-Free, P10-Free Graphs. J. Graph Theory 71(4): 435-447 (2012) - Salman Ghazal:
Seymour's Second Neighborhood Conjecture for Tournaments Missing a Generalized Star. J. Graph Theory 71(1): 89-94 (2012) - Qiaoping Guo, Shengjia Li, Ruijuan Li:
The structure of 4-strong tournaments containing exactly three out-arc pancyclic vertices. J. Graph Theory 71(3): 260-277 (2012) - András Gyárfás, Gábor Simonyi, Ágnes Tóth:
Gallai colorings and domination in multipartite digraphs. J. Graph Theory 71(3): 278-292 (2012) - Stephen G. Hartke, Tyler Seacrest:
Graphic Sequences Have Realizations Containing Bisections of Large Degree. J. Graph Theory 71(4): 386-401 (2012) - Aaron Hill, Steve Wilson:
Four Constructions of Highly Symmetric Tetravalent Graphs. J. Graph Theory 71(3): 229-244 (2012) - Chính T. Hoàng, Frédéric Maffray, Meriem Mechebbek:
A Characterization of b-Perfect Graphs. J. Graph Theory 71(1): 95-122 (2012) - Xinmin Hou, Cun-Quan Zhang:
A note on shortest cycle covers of cubic graphs. J. Graph Theory 71(2): 123-127 (2012) - Ken-ichi Kawarabayashi, John Maharry:
Minors in large almost-5-connected non-planar graphs. J. Graph Theory 71(2): 128-141 (2012) - Henry A. Kierstead, Alexandr V. Kostochka:
Every 4-Colorable Graph With Maximum Degree 4 Has an Equitable 4-Coloring. J. Graph Theory 71(1): 31-48 (2012) - Choongbum Lee, Wojciech Samotij:
Pancyclic subgraphs of random graphs. J. Graph Theory 71(2): 142-158 (2012) - Linyuan Lu, Xing Peng:
On Meyniel's conjecture of the cop number. J. Graph Theory 71(2): 192-205 (2012) - Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
The structure of graphs with a vital linkage of order 2. J. Graph Theory 71(2): 176-181 (2012) - Michael Molloy, Giovanna Thron:
An asymptotically tight bound on the adaptable chromatic number. J. Graph Theory 71(3): 331-351 (2012) - Reza Zamani, Douglas B. West:
Spanning Cycles Through Specified Edges in Bipartite Graphs. J. Graph Theory 71(1): 1-17 (2012) - Jin-Xin Zhou:
Tetravalent vertex-transitive graphs of order 4p. J. Graph Theory 71(4): 402-415 (2012)
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-05-27 21:15 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