default search action
Discrete Applied Mathematics, Volume 321
Volume 321, November 2022
- Gyula O. H. Katona:
A generalization of the independence number. 1-3
- Glenn Hurlbert
, Vikram Kamat:
On intersecting families of independent sets in trees. 4-9 - Xuemei Liu
On forcibly k-connected and forcibly k-arc-connected digraphic sequences. 10-18
- Min-Jen Chen
Proof of a Conjecture About Minimum Spanning Tree Cycle Intersection. 19-23
- Ye Chen, Suohai Fan, Hong-Jian Lai
Graph r-hued colorings - A survey. 24-48
- Guillaume Bagan, Fairouz Beggas, Mohammed Haddad, Hamamache Kheddouci:
Complexity of edge monitoring on some graph classes. 49-63 - Xiang Qin, Baoyindureng Wu
Decomposition of graphs with constraint on minimum degree. 64-71 - Margarita Akhmejanova
Chain method for panchromatic colorings of hypergraphs. 72-81 - Ludwin A. Basilio
The differential of the line graph L(G). 82-89 - Mikhail Moshkov
Rough analysis of computation trees. 90-108 - Guillaume Escamocher
Regular pattern-free coloring. 109-125 - John Baptist Gauci
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants. 126-137 - Rosário Fernandes
On certain trees with the same degree sequence. 138-146 - Yunchao Hong, Lianying Miao:
Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance. 147-158 - Lily Chen
The inclusion-free edge-colorings of (3, Δ)-bipartite graphs. 159-164 - Jing Wang, Xiaogang Liu:
State transfers in vertex complemented coronas. 165-178 - Marc Hellmuth
From modular decomposition trees to level-1 networks: Pseudo-cographs, polar-cats and prime polar-cats. 179-219 - Leah Epstein
Open-end bin packing: New and old analysis approaches. 220-239 - Jinfeng Qi
The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains. 240-249 - Tanja Dravec
On the toll number of a graph. 250-257
- Daniel W. Cranston
Strong edge-coloring of cubic bipartite graphs: A counterexample. 258-260
- Arthur S. Finbow
A characterization of well-indumatchable graphs having girth greater than seven. 261-271 - Juan Wang
Acyclic coloring of claw-free graphs with small degree. 272-280 - Naoka Fukuzono, Tesshu Hanaka
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. 281-294 - Peter Dankelmann
On the difference between proximity and other distance parameters in triangle-free graphs and C4-free graphs. 295-307 - Katarína Cekanová, Tomás Madaras
On the structure of essentially-highly-connected polyhedral graphs. 308-315 - Daniel A. Jaume, Cristian Panelo
On the structure of the inverse of non-singular unicyclic graphs. 316-332 - David Könen
Finding all minimum cost flows and a faster algorithm for the K best flow problem. 333-349
- Xiaoxia Lin, Keke Wang, Meng Zhang, Hong-Jian Lai
Bounding ℓ-edge-connectivity in edge-connectivity. 350-356 - Hsin-Hao Lai
A note on additive choice number of planar graphs. 357-359
- Yueyu Wu
Degree sums and proper connection number of graphs. 360-367
- Márcia R. Cappelle, Erika M. M. Coelho, Hebert Coelho, Braully R. Silva, Uéverton S. Souza, Fábio Protti:
P3-convexity on graphs with diameter two: Computing hull and interval numbers. 368-378
- Bernardo M. Ábrego, Silvia Fernández-Merchant
The outerplanar crossing number of the complete bipartite graph. 379-384
- Mirko Petrusevski, Riste Skrekovski
Colorings with neighborhood parity condition. 385-391 - Yair Caro, Mirko Petrusevski, Riste Skrekovski
Remarks on odd colorings of graphs. 392-401 - Amotz Bar-Noy, Toni Böhnlein, Zvi Lotker, David Peleg, Dror Rawitz:
The generalized microscopic image reconstruction problem. 402-416
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-01-27 20:44 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: