default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 331
Volume 331, May 2023
- Tingyan Ma, Guoyan Ao, Ruifang Liu, Ligong Wang, Yang Hu:
An improvement of sufficient condition for k-leaf-connected graphs. 1-10 - Dibyayan Chakraborty
, Sandip Das, Srijit Mukherjee, Uma Kant Sahoo, Sagnik Sen:
Triangle-free projective-planar graphs with diameter two: Domination and characterization. 11-24 - Vladimir R. Rosenfeld:
Covering automorphisms and some eigenvalues of a graph. 25-30 - Julián Fresán-Figueroa, Diego González-Moreno, Mika Olsen:
Special structures in Q(4,q), projective planes and its application in L(h,k)-colorings of their Moore Graphs. 31-37 - Carsten R. Seemann, Vincent Moulton, Peter F. Stadler, Marc Hellmuth:
Planar median graphs and cubesquare-graphs. 38-58 - Tínaz Ekim, Arthur M. Farley, Andrzej Proskurowski, Mordechai Shalom:
Defensive domination in proper interval graphs. 59-69 - Allan Bickle, Zhongyuan Che:
Irregularities of maximal k-degenerate graphs. 70-87 - Eranda Çela, Elisabeth Gaar:
On k-bend and monotonic ℓ-bend edge intersection graphs of paths on a grid. 88-103 - Annachiara Korchmaros, David Schaller, Marc Hellmuth, Peter F. Stadler:
Quasi-best match graphs. 104-125 - Benjamin Chen, Michael Cho, Mario Tutuncu-Macias, Tony Tzolov:
Efficient methods of calculating the number of heapable permutations. 126-137 - Abolfazl Poureidi:
Counting independent sets in tricyclic graphs. 138-146 - Lingxi Li, Huajing Lu, Tao Wang, Xuding Zhu:
Decomposition of planar graphs with forbidden configurations. 147-158
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-03-01 15:03 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:
