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 706 matches
- 2025
- Kengo Aoki:
Improved 2-distance coloring of planar graphs with maximum degree 5. Discret. Math. 348(1): 114225 (2025) - 2024
- Joshua Harrelson, Jessica McDonald:
List-edge-coloring triangulations with maximum degree at most five. Australas. J Comb. 88: 127-143 (2024) - Shan Zhang, Xun Chen, Zhen-Wei Ma, Xiao-Dong Zhang, Ya-Hong Chen:
The minimum Wiener index of unicyclic graphs with maximum degree. Appl. Math. Comput. 470: 128581 (2024) - Peter Frankl, Jian Wang:
Improved Bounds Concerning the Maximum Degree of Intersecting Hypergraphs. Electron. J. Comb. 31(2) (2024) - Tom Kelly, Daniela Kühn, Deryk Osthus:
A special case of Vu's conjecture: colouring nearly disjoint graphs of bounded maximum degree. Comb. Probab. Comput. 33(2): 179-195 (2024) - Eun-Kyung Cho, Ilkyoo Choi, Bernard Lidický:
Relaxation of Wegner's planar graph conjecture for maximum degree 4. Discret. Appl. Math. 358: 254-261 (2024) - Jian Lu, Huiqing Liu, Xiaolan Hu:
On strong edge-coloring of graphs with maximum degree 5. Discret. Appl. Math. 344: 120-128 (2024) - Atílio G. Luiz:
Roman domination and independent Roman domination on graphs with maximum degree three. Discret. Appl. Math. 348: 260-278 (2024) - Ting Zhou, Lianying Miao, Wenyao Song:
On the eccentric distance sum of trees with given maximum degree. Discret. Appl. Math. 348: 79-86 (2024) - Jiani Zou, Miaomiao Han, Hong-Jian Lai:
Square coloring of planar graphs with maximum degree at most five. Discret. Appl. Math. 353: 4-11 (2024) - Alexandr V. Kostochka, Duo Lin, Zimu Xiang:
Equitable coloring of planar graphs with maximum degree at least eight. Discret. Math. 347(6): 113964 (2024) - Mateusz Krzyzinski, Pawel Rzazewski, Szymon Tur:
Coloring squares of planar graphs with small maximum degree. Discuss. Math. Graph Theory 44(3): 817 (2024) - Wenqian Zhang:
The Spectral Radius, Maximum Average Degree and Cycles of Consecutive Lengths of Graphs. Graphs Comb. 40(2): 32 (2024) - Fei Guo, Zilong Wang:
Balanced Even-Variable Rotation Symmetric Boolean Functions with Optimal Algebraic Immunity, Maximum Algebraic Degree and Higher Nonlinearity. Int. J. Found. Comput. Sci. 35(3): 245-270 (2024) - Milad Ahanjideh, Tínaz Ekim, Mehmet Akif Yildiz:
Maximum size of a triangle-free graph with bounded maximum degree and matching number. J. Comb. Optim. 47(4): 57 (2024) - Lele Liu:
Extremal spectral radius of nonregular graphs with prescribed maximum degree. J. Comb. Theory B 169: 430-479 (2024) - Yuni Iwamasa:
A combinatorial algorithm for computing the entire sequence of the maximum degree of minors of a generic partitioned polynomial matrix with 2 ˟ 2 submatrices. Math. Program. 204(1): 27-79 (2024) - Alan M. Frieze, Krzysztof Turowski, Wojciech Szpankowski:
On the Concentration of the Maximum Degree in the Duplication-Divergence Models. SIAM J. Discret. Math. 38(1): 988-1006 (2024) - Stefanie Gerke, Gregory Z. Gutin, Anders Yeo, Yacong Zhou:
Lower Bounds for Maximum Weight Bisections of Graphs with Bounded Degrees. CoRR abs/2401.10074 (2024) - Steven Chaplick, Martin Frohn, Steven Kelk, Johann Lottermoser, Matús Mihalák:
Approximation Ratio of the Min-Degree Greedy Algorithm for Maximum Independent Set on Interval and Chordal Graphs. CoRR abs/2403.10868 (2024) - Narmina Baghirova, Antoine Castillon:
Proportionally dense subgraphs of maximum size in degree-constrained graphs. CoRR abs/2405.20847 (2024) - Péter Ágoston, Adrian Dumitrescu, Arsenii Sagdeev, Karamjeet Singh, Ji Zeng:
Maximizing the Maximum Degree in Ordered Yao Graphs. CoRR abs/2406.08913 (2024) - 2023
- Mohammad Ali Manian, Shahram Heidarian, Farhad Khaksar Haghani:
Maximum and minimum values of inverse degree and forgotten indices on the class of all unicyclic graphs. AKCE Int. J. Graphs Comb. 20(1): 57-60 (2023) - Jiahao Yu, Min Chen, Weifan Wang:
2-Distance choosability of planar graphs with a restriction for maximum degree. Appl. Math. Comput. 448: 127949 (2023) - Jingjing Huo, Sensen Wen, Yulong Chen, Mingchao Li:
Neighbor Distinguishing Colorings of Graphs with the Restriction for Maximum Average Degree. Axioms 12(12): 1132 (2023) - Baoheng Liu, Xiaochuan Zhang, Shuyang Jia, Sichen Zou, Deyan Tian:
Variational Bayesian-Based Adaptive Maximum Correntropy Generalized High-Degree Cubature Kalman Filter. Circuits Syst. Signal Process. 42(12): 7073-7098 (2023) - Tapas Das, Sagnik Sen:
Pushable chromatic number of graphs with maximum average degree at most 145. Discret. Appl. Math. 334: 163-171 (2023) - Danjun Huang, Hongfeng Cai, Weifan Wang, Jingjing Huo:
Neighbor-distinguishing indices of planar graphs with maximum degree ten. Discret. Appl. Math. 329: 49-60 (2023) - Lin Sun, Guanglong Yu, Xin Li:
Adjacent vertex distinguishing edge choosability of 1-planar graphs with maximum degree at least 23. Discret. Appl. Math. 337: 257-271 (2023) - Junlei Zhu:
Injective edge coloring of graphs with maximum degree 5. Discret. Appl. Math. 334: 119-126 (2023)
skipping 676 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-09-23 02:30 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