default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 224
Volume 224, June 2017
- Saieed Akbari
, Péter Csikvári, A. Ghafari, S. Khalashi Ghezelahmad, Mina Nahvi:
Graphs with integer matching polynomial zeros. 1-8 - Jean-Luc Baril, Vincent Vajnovszki:
A permutation code preserving a double Eulerian bistatistic. 9-15 - Frédérique Bassino, Mathilde Bouvel, Adeline Pierrot, Carine Pivoteau, Dominique Rossin:
An algorithm computing combinatorial specifications of permutation classes. 16-44 - Adam H. Berliner, Chassidy Bozeman, Steve Butler, Minerva Catral, Leslie Hogben, Brenda Kroschel, Jephian C.-H. Lin, Nathan Warnberg, Michael Young:
Zero forcing propagation time on oriented graphs. 45-59 - Dongqin Cheng:
Cycles embedding in folded hypercubes under the conditional fault model. 60-68 - Kai Deng, Heping Zhang:
Extremal anti-forcing numbers of perfect matchings of graphs. 69-79 - José Miguel Díaz-Báñez, Mario Alberto López, Carlos Ochoa, Pablo Pérez-Lantero:
Computing the coarseness with strips or boxes. 80-90 - Arthur S. Finbow, Bert L. Hartnell, Michael D. Plummer:
On well-covered pentagonalizations of the plane. 91-105 - Yuan Xue, Boting Yang:
The fast search number of a Cartesian product of graphs. 106-119
- Renyu Xu, Jian-Liang Wu:
A sufficient condition for a planar graph to be 4-choosable. 120-122
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 2025-02-21 19:35 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:
