Остановите войну!
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 32 matches
- 2023
- Arnab Char, T. Karthick:
Improved bounds on the chromatic number of (P5, flag)-free graphs. Discret. Math. 346(9): 113501 (2023) - Shude Long, Han Ren:
Upper Bounds on the Chromatic Polynomial of a Connected Graph with Fixed Clique Number. Graphs Comb. 39(3): 57 (2023) - 2022
- Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower Bounds on the Chromatic Number of Random Graphs. Comb. 42(5): 617-658 (2022) - Sergey Norin, Zi-Xia Song:
A New Upper Bound on the Chromatic Number of Graphs with No Odd Kt Minor. Comb. 42(1): 137-149 (2022) - 2021
- Yian Xu:
A better upper bound on the chromatic number of (cap, even-hole)-free graphs. Discret. Math. 344(11): 112581 (2021) - 2018
- Peter J. Ayre, Amin Coja-Oghlan, Catherine S. Greenhill:
Lower bounds on the chromatic number of random graphs. CoRR abs/1812.09691 (2018) - 2017
- Xiao Wang, Baoyindureng Wu:
Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree. J. Comb. Optim. 33(1): 28-34 (2017) - 2015
- Amine El Sahili, Mekkia Kouider, Maidoun Mortada:
On the b-chromatic number of regular bounded graphs. Discret. Appl. Math. 193: 174-179 (2015) - Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. Eur. J. Comb. 43: 295-305 (2015) - Ira Apni Purwasih, Edy Tri Baskoro, Hilda Assiyatun, Djoko Suprijanto:
The Bounds on the Locating-Chromatic Number for a Subdivision of a Graph on One Edge. ICGTIS 2015: 84-88 - 2014
- Mostafa Blidia, Ahmed Bouchou, Lutz Volkmann:
Bounds on the k-independence and k-chromatic numbers of graphs. Ars Comb. 113: 33-46 (2014) - 2013
- Tao Wang, Deming Li:
An improved upper bound on the adjacent vertex distinguishing edge chromatic number of a simple graph. Ars Comb. 110: 421-433 (2013) - Jonathan A. Noel, Douglas B. West, Hehui Wu, Xuding Zhu:
Beyond Ohba's Conjecture: A bound on the choice number of k-chromatic graphs with n vertices. CoRR abs/1308.6739 (2013) - 2011
- Chao Li, Weifan Wang, André Raspaud:
Upper bounds on the linear chromatic number of a graph. Discret. Math. 311(4): 232-238 (2011) - 2010
- Ashwin Ganesan:
The performance of an upper bound on the fractional chromatic number of weighted graphs. Appl. Math. Lett. 23(5): 597-599 (2010) - Alain Doyon, Gena Hahn, André Raspaud:
Some bounds on the injective chromatic number of graphs. Discret. Math. 310(3): 585-590 (2010) - Ashwin Ganesan:
On some upper bounds on the fractional chromatic number of weighted graphs. CoRR abs/1001.3053 (2010) - 2005
- Michael Molloy, Mohammad R. Salavatipour:
A bound on the chromatic number of the square of a planar graph. J. Comb. Theory B 94(2): 189-213 (2005) - Alice M. Dean, William S. Evans, Ellen Gethner, Joshua D. Laison, Mohammad Ali Safari, William T. Trotter:
Bar k-Visibility Graphs: Bounds on the Number of Edges, Chromatic Number, and Thickness. GD 2005: 73-82 - 2004
- Massimiliano Caramia, Jirí Fiala:
New lower bounds on the weighted chromatic number of a graph. Discuss. Math. Graph Theory 24(2): 183-195 (2004) - 2002
- Van H. Vu:
A General Upper Bound On The List Chromatic Number Of Locally Sparse Graphs. Comb. Probab. Comput. 11(1): 103-111 (2002) - 2001
- Massimiliano Caramia, Paolo Dell'Olmo:
A lower bound on the chromatic number of Mycielski graphs. Discret. Math. 235(1-3): 79-86 (2001) - 1996
- Nabil Kahalé, Leonard J. Schulman:
Bounds on the Chromatic Polynomial and on the Number of Acyclic Orientations of a Graph. Comb. 16(3): 383-397 (1996) - 1992
- Roland Häggkvist, Amanda G. Chetwynd:
Some upper bounds on the total and list chromatic numbers of multigraphs. J. Graph Theory 16(5): 503-516 (1992) - 1991
- Zhikang Lu:
On an upper bound for the harmonious chromatic number of a graph. J. Graph Theory 15(4): 345-347 (1991) - 1989
- Richard Beigel, William I. Gasarch:
On the Complexity of Finding the Chromatic Number of a Recursive Graph I: The Bounded Case. Ann. Pure Appl. Log. 45(1): 1-38 (1989) - 1980
- Stanley Wagon:
A bound on the chromatic number of graphs without certain induced subgraphs. J. Comb. Theory B 29(3): 345-346 (1980) - 1978
- Paul A. Catlin:
Another bound on the chromatic number of a graph. Discret. Math. 24(1): 1-6 (1978) - Paul A. Catlin:
A bound on the chromatic number of a graph. Discret. Math. 22(1): 81-83 (1978) - Ján Plesník:
Bounds on chromatic numbers of multiple factors of a complete graph. J. Graph Theory 2(1): 9-17 (1978)
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 2024-08-01 12:57 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