default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 334
Volume 334, November 2014
- Xuechao Li, Bing Wei
:
Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees. 1-12 - Jiangxu Kong, Lianzhu Zhang, Wei-Fan Wang:
The surviving rate of digraphs. 13-19 - Yi-Zheng Fan, Ying-Ying Tan:
The least eigenvalue of signless Laplacian of non-bipartite graphs with given domination number. 20-25 - Niraj Khare:
On the size of 3-uniform linear hypergraphs. 26-37 - Ed Wynn:
Exhaustive generation of 'Mrs. Perkins's quilt' square dissections for low orders. 38-47 - Meirun Chen, Xiaofeng Guo, Hao Li, Lianzhu Zhang:
Total chromatic number of generalized Mycielski graphs. 48-51 - Gábor N. Sárközy:
Improved monochromatic loose cycle partitions in hypergraphs. 52-62 - Oleg V. Borodin, Anna O. Ivanova, Douglas R. Woodall:
Light C4 and C5 in 3-polytopes with minimum degree 5. 63-69 - Guanghui Wang, Zhumin Chen, Jihui Wang:
Neighbor sum distinguishing index of planar graphs. 70-73
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.
last updated on 2026-03-28 22:22 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
