default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Applied Mathematics, Volume 222
Volume 222, May 2017
- Enes Pasalic
, Anupam Chattopadhyay, Debabani Chowdhury:
An analysis of root functions - A subclass of the Impossible Class of Faulty Functions (ICFF). 1-13
- Agostinho Agra, Geir Dahl, Torkel Andreas Haufmann, Sofia J. Pinheiro:
The k-regular induced subgraph problem. 14-30 - Mustapha Aouchiche, Pierre Hansen:
Proximity, remoteness and girth in graphs. 31-39 - Olivier Baudon, Monika Pilsniak, Jakub Przybylo, Mohammed Senhaji, Éric Sopena, Mariusz Wozniak:
Equitable neighbour-sum-distinguishing edge and total colourings. 40-53 - Patrice Bertrand, Jean Diatta:
Multilevel clustering models and interval convexities. 54-66 - Susil Kumar Bishoi, Himanshu Kumar Haran, Sartaj Ul Hasan:
A note on the multiple-recursive matrix method for generating pseudorandom vectors. 67-75 - Jason I. Brown, Aysel Erey:
Restraints permitting the largest number of colourings. 76-88 - Jihoon Choi, Suh-Ryung Kim, Jung Yeun Lee, Yoshio Sano:
On the partial order competition dimensions of chordal graphs. 89-96 - Oleg Duginov:
Secure total domination in graphs: Bounds and complexity. 97-108 - Matteo Fischetti, Leo Liberti, Domenico Salvagnin, Toby Walsh:
Orbital shrinking: Theory and applications. 109-123 - Kathleen E. Hamilton, Leonid P. Pryadko:
Algebraic bounds for heterogeneous site percolation on directed and undirected graphs. 124-142 - Muhammad Kamran Jamil, Ioan Tomescu:
Minimum general sum-connectivity index of trees and unicyclic graphs having a given matching number. 143-150 - Monique Laurent, Matteo Seminaroti:
A Lex-BFS-based recognition algorithm for Robinsonian matrices. 151-165 - Hao Li, Hong-Jian Lai:
3-dynamic coloring and list 3-dynamic coloring of K1, 3-free graphs. 166-171 - Avery Miller, Andrzej Pelc:
Deterministic distributed construction of T-dominating sets in time T. 172-178 - Fenglei Tian, Dein Wong:
Relation between the skew energy of an oriented graph and its matching number. 179-184 - Wenchao Wei, Kris Coolen, Fabrice Talla Nobibon, Roel Leus:
Minimum-cost diagnostic strategies for k-out-of-n systems with imperfect tests. 185-196 - Xia Zhang, Jianfeng Hou, Guizhen Liu, Guiying Yan:
Graphs of f-class 1. 197-204
- Adel Alahmadi, Cem Güneri, Buket Özkaya, Hatoon Shohaib, Patrick Solé:
On self-dual double negacirculant codes. 205-212 - Qing Cui, Lingping Zhong:
On the general sum-connectivity index of trees with given number of pendent vertices. 213-221 - Darko Dimitrov, Barbara Ikica, Riste Skrekovski:
Remarks on maximum atom-bond connectivity index with given graph parameters. 222-226 - Ushnish Sarkar, Avishek Adhikari:
On relationship between Hamiltonian path and holes in -coloring of minimum span. 227-234
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-03 23:18 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:
