default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 324
Volume 324, January 2023
- Sean Dewar
, Jan Legerský:
Flexing infinite frameworks with applications to braced Penrose tilings. 1-17
- Fei Guo, Zilong Wang:
Balanced odd-variable rotation symmetric Boolean functions with optimal algebraic immunity and higher nonlinearity. 18-28 - Dipayan Chakraborty, Sandip Das, Soumen Nandi, Debdeep Roy, Sagnik Sen:
On clique numbers of colored mixed graphs. 29-40
- Liqiong Xu:
Symmetric property and the bijection between perfect matchings and sub-hypercubes of enhanced hypercubes. 41-45
- Mei-Mei Gu, Jou-Ming Chang:
Neighbor connectivity of pancake graphs and burnt pancake graphs. 46-57 - Juan Carlos García-Altamirano, César Hernández-Cruz:
Minimal obstructions for a matrix partition problem in chordal graphs. 58-66
- Rui Chen, Sanjeeb Dash, Oktay Günlük:
Multilinear sets with two monomials and cardinality constraints. 67-79
- Igor Fabrici, Borut Luzar, Simona Rindosová, Roman Soták:
Proper conflict-free and unique-maximum colorings of planar graphs with respect to neighborhoods. 80-92 - Joshua Harrington, Xuwen Hua, Xufei Liu, Alex Nash, Rodrigo Rios, Tony W. H. Wong:
Probabilistic chip-collecting games with modulo winning conditions. 93-98 - Wei Yang, Baoyindureng Wu:
Disproof of a conjecture on the rainbow triangles in arc-colored digraphs. 99-102 - Matthias Bentert, Tomohiro Koana, Rolf Niedermeier:
The complexity of gerrymandering over graphs: Paths and trees. 103-112
- Alda Carvalho, Carlos Pereira dos Santos:
Some notes on disjunctive short sum: polychromatic nim. 113-125
- Qianqian Liu, Heping Zhang:
Some tight bounds on the minimum and maximum forcing numbers of graphs. 126-135 - Mahdieh Azari, Nasrin Dehgardi, Tomislav Doslic:
Lower bounds on the irregularity of trees and unicyclic graphs. 136-144 - Andreas Bärmann, Patrick Gemander, Maximilian Merkert, Ann-Kathrin Wiertz, Francisco Javier Zaragoza Martínez:
Algorithms for the clique problem with multiple-choice constraints under a series-parallel dependency graph. 145-166 - Yair Caro, Josef Lauri, Christina Zarb:
The feasibility problem for line graphs. 167-180 - Elisabeth Gaar, Daniel Krenn:
A characterization of graphs with regular distance-2 graphs. 181-218
- Rachel Kirsch, Bernard Lidický, Clare Sibley, Elizabeth Sprangel:
Shortened universal cycles for permutations. 219-228
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-10-31 01:08 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:
