default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 323
Volume 323, May 2014
- Felix Joos:
Independence and matching number in graphs with maximum degree 4. 1-6 - Edward Dobson, István Kovács, Stefko Miklavic:
The isomorphism problem for rose window graphs. 7-13 - Frédéric Meunier:
Simplotopal maps and necklace splitting. 14-26 - Yan Liu, Zhengbiao Liu:
Second kind maximum matching graph. 27-34 - Jennifer Diemunsch, Michael Ferrara, Samantha Graffeo, Timothy Morris:
On 2-factors with a bounded number of odd components. 35-42 - Sam Hopkins:
Another proof of Wilmes' conjecture. 43-48 - Chak-On Chow, Shi-Mei Ma
:
Counting signed permutations by their alternating runs. 49-57 - Albert Burgos:
Two results about Matula numbers. 58-62 - Andrzej Dudek:
On balanced colorings of sparse hypergraphs. 63-68 - Michael A. Henning, Christian Löwenstein:
A characterization of hypergraphs that achieve equality in the Chvátal-McDiarmid Theorem. 69-75 - Yanbo Zhang, Yunqing Zhang, Yaojun Chen:
The Ramsey numbers of wheels versus odd cycles. 76-80 - Paul S. Wenger:
A note on the saturation number of the family of k-connected graphs. 81-83
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 2024-09-18 00:21 CEST 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:
