Остановите войну!
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
Likely 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 86 matches
- 2023
- Gexin Yu, Rachel Yu:
Strong edge-coloring of 2-degenerate graphs. Discret. Appl. Math. 336: 11-14 (2023) - Xiaofeng Gu, Runrun Liu, Gexin Yu:
Spanning tree packing and 2-essential edge-connectivity. Discret. Math. 346(1): 113132 (2023) - Runrun Liu, Martin Rolek, Gexin Yu:
Optimal connectivity for fat-triangle linkages. Discret. Math. 346(5): 113319 (2023) - Runrun Liu, Weifan Wang, Gexin Yu:
1-planar graphs are odd 13-colorable. Discret. Math. 346(8): 113423 (2023) - 2022
- Zhengke Miao, Yimin Song, Gexin Yu:
Note on injective edge-coloring of graphs. Discret. Appl. Math. 310: 65-74 (2022) - Yue Wang, Gexin Yu:
Partition graphs of independence number 2 into two subgraphs with large chromatic numbers. Discret. Math. 345(4): 112781 (2022) - Robin M. Givens, Gexin Yu, Rex K. Kincaid:
Open locating-dominating sets in circulant graphs. Discuss. Math. Graph Theory 42(1): 47-62 (2022) - Yue Wang, Gexin Yu:
Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. J. Graph Theory 101(1): 134-141 (2022) - 2021
- Xiangwen Li, Runrun Liu, Gexin Yu:
Planar graphs without 4-cycles and intersecting triangles are (1, 1, 0)-colorable. Discret. Appl. Math. 304: 236-247 (2021) - Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
An improved linear connectivity bound for tournaments to be highly linked. Eur. J. Comb. 98: 103390 (2021) - Xiaofeng Gu, Wei Meng, Martin Rolek, Yue Wang, Gexin Yu:
Sufficient Conditions for 2-Dimensional Global Rigidity. SIAM J. Discret. Math. 35(4): 2520-2534 (2021) - Runrun Liu, Martin Rolek, D. Christopher Stephens, Dong Ye, Gexin Yu:
Connectivity for Kite-Linked Graphs. SIAM J. Discret. Math. 35(1): 431-446 (2021) - 2020
- Runrun Liu, Xiangwen Li, Kittikorn Nakprasit, Pongpat Sittitrai, Gexin Yu:
DP-4-colorability of planar graphs without adjacent cycles of given length. Discret. Appl. Math. 277: 245-251 (2020) - Runrun Liu, Xujun Liu, Martin Rolek, Gexin Yu:
Packing (1, 1, 2, 2)-coloring of some subcubic graphs. Discret. Appl. Math. 283: 626-630 (2020) - Runrun Liu, Gexin Yu:
Planar graphs without short even cycles are near-bipartite. Discret. Appl. Math. 284: 626-630 (2020) - Lily Chen, Mingfang Huang, Gexin Yu, Xiangqian Zhou:
The strong edge-coloring for graphs with small edge weight. Discret. Math. 343(4): 111779 (2020) - Seog-Jin Kim, Runrun Liu, Gexin Yu:
Planar graphs without 7-cycles and butterflies are DP-4-colorable. Discret. Math. 343(8): 111714 (2020) - Xiangwen Li, Yuxue Yin, Gexin Yu:
Every planar graph without 5-cycles and K4- and adjacent 4-cycles is (2, 0, 0)-colorable. Discret. Math. 343(2): 111661 (2020) - 2019
- Lily Chen, Kecai Deng, Gexin Yu, Xiangqian Zhou:
Strong edge-coloring for planar graphs with large girth. Discret. Math. 342(2): 339-343 (2019) - Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou:
DP-4-colorability of two classes of planar graphs. Discret. Math. 342(11): 2984-2993 (2019) - Ilkyoo Choi, Gexin Yu, Xia Zhang:
Planar graphs with girth at least 5 are (3, 4)-colorable. Discret. Math. 342(12) (2019) - Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu:
DP-3-coloring of some planar graphs. Discret. Math. 342(1): 178-189 (2019) - Runrun Liu, Martin Rolek, Gexin Yu:
Minimum degree condition for a graph to be knitted. Discret. Math. 342(11): 3225-3228 (2019) - Yuxue Yin, Gexin Yu:
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable. Discret. Math. 342(8): 2333-2341 (2019) - Kecai Deng, Gexin Yu, Xiangqian Zhou:
Recent progress on strong edge-coloring of graphs. Discret. Math. Algorithms Appl. 11(5): 1950062:1-1950062:21 (2019) - Runrun Liu, Sarah Loeb, Martin Rolek, Yuxue Yin, Gexin Yu:
DP-3-Coloring of Planar Graphs Without 4, 9-Cycles and Cycles of Two Lengths from {6, 7, 8}. Graphs Comb. 35(3): 695-705 (2019) - 2018
- Mingfang Huang, Michael Santana, Gexin Yu:
Strong Chromatic Index of Graphs With Maximum Degree Four. Electron. J. Comb. 25(3): 3 (2018) - Jian-Bo Lv, Xiangwen Li, Gexin Yu:
On strong edge-coloring of graphs with maximum degree 4. Discret. Appl. Math. 235: 142-153 (2018) - Tianjiao Dai, Guanghui Wang, Donglei Yang, Gexin Yu:
Strong list-chromatic index of subcubic graphs. Discret. Math. 341(12): 3434-3440 (2018) - Heather Hoskins, Runrun Liu, Jennifer Vandenbussche, Gexin Yu:
Planar graphs without 4-cycles and close triangles are (2, 0, 0)-colorable. J. Comb. Optim. 36(2): 346-364 (2018)
skipping 56 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-04-24 21:02 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