• case-insensitive prefix search: default
  e.g., sig matches "SIGIR" as well as "signal"
• exact word search: append dollar sign ($) to word
  e.g., graph$ matches "graph", but not "graphics"
• boolean and: separate words by space
  e.g., codd model
• boolean or: connect words by pipe symbol (|)
  e.g., graph|network

Update May 7, 2017: Please note that we had to disable the phrase search operator (.) and the boolean not operator (-) due to technical problems. For the time being, phrase search queries will yield regular prefix search result, and search terms preceded by a minus will be interpreted as regular (positive) search terms.

found 36 matches

• 2024
• 
  Nicolás Alvarez, Verónica Becher, Martín Mereb, Ivo Pajor, Carlos Miguel Soto:
  On extremal factors of de Bruijn-like graphs. Discret. Appl. Math. 357: 352-364 (2024)
• 
  Enrico Angelelli, Andrea Mor, Maria Grazia Speranza:
  The one-station bike repositioning problem. Discret. Appl. Math. 357: 173-196 (2024)
• 
  Toru Araki:
  A lower bound for secure domination number of an outerplanar graph. Discret. Appl. Math. 357: 81-85 (2024)
• 
  Ahmet Batal:
  Effects of edge addition or removal on the nullity of a graph. Discret. Appl. Math. 357: 56-65 (2024)
• 
  Elmer Bergman, Lasse Leskelä:
  Connectivity of random hypergraphs with a given hyperedge size distribution. Discret. Appl. Math. 357: 1-13 (2024)
• 
  Ivica Bosnjak, Rozália Madarász, Samir Zahirovic:
  Some new results concerning power graphs and enhanced power graphs of groups. Discret. Appl. Math. 357: 86-93 (2024)
• 
  Manoj Changat, Ameera Vaheeda Shanavas, Peter F. Stadler:
  Transit functions and pyramid-like binary clustering systems. Discret. Appl. Math. 357: 365-384 (2024)
• 
  Ran Chen, Di Wu, Baogang Xu:
  Structure of some ( P7, C4)-free graphs with application to colorings. Discret. Appl. Math. 357: 14-23 (2024)
• 
  Ping Chen, Xin Zhang:
  Improper odd coloring of IC-planar graphs. Discret. Appl. Math. 357: 74-80 (2024)
• 
  Eun-Kyung Cho, Minki Kim:
  Independent domination versus packing in subcubic graphs. Discret. Appl. Math. 357: 132-134 (2024)
• 
  Daniel W. Cranston, Carl Feghali:
  Kempe classes and almost bipartite graphs. Discret. Appl. Math. 357: 94-98 (2024)
• 
  Christophe Crespelle, Rémi Pellerin, Stéphan Thomassé:
  A quasi-quadratic vertex-kernel for Cograph Edge Editing. Discret. Appl. Math. 357: 282-296 (2024)
• 
  Oscar Defrain, Antonio E. Porreca, Ekaterina Timofeeva:
  Polynomial-delay generation of functional digraphs up to isomorphism. Discret. Appl. Math. 357: 24-33 (2024)
• 
  Fang Duan, Yuhong Yang:
  Triangle-free signed graphs with small negative inertia index. Discret. Appl. Math. 357: 135-142 (2024)
• 
  Tithi Dwary, Kanduru V. Krishna:
  Word-representability of graphs with respect to split recomposition. Discret. Appl. Math. 357: 310-321 (2024)
• 
  Yu-Xia Hao, Xiaomeng Wang:
  Regular sets in circulant graphs with degree 3. Discret. Appl. Math. 357: 51-55 (2024)
• 
  Xin He, Heping Zhang:
  Complete forcing numbers of (4,6)-fullerenes. Discret. Appl. Math. 357: 385-398 (2024)
• 
  Sinan Hu, Zhidan Luo, Yuejian Peng:
  Saturation numbers of joins of graphs. Discret. Appl. Math. 357: 300-309 (2024)
• 
  Alpár Jüttner, Csaba Király, Lydia Mirabel Mendoza Cadena, Gyula Pap, Ildikó Schlotter, Yutaro Yamaguchi:
  Shortest odd paths in undirected graphs with conservative weight functions. Discret. Appl. Math. 357: 34-50 (2024)
• 
  Thomas Kalinowski, Uwe Leck:
  Independent domination in the graph defined by two consecutive levels of the n-cube. Discret. Appl. Math. 357: 161-172 (2024)
• 
  M. Rajesh Kannan, Pragada Shivaramakrishna, Hitesh Wankhede:
  Constructing cospectral graphs by unfolding non-bipartite graphs. Discret. Appl. Math. 357: 264-273 (2024)
• 
  François Lamothe, Claudio Contardo, Matthieu Gruson:
  Tilted inequalities and facets of the set covering polytope: A theoretical analysis. Discret. Appl. Math. 357: 143-160 (2024)
• 
  Lin Li, Rong-Xia Hao, Wen-Han Zhu:
  The 3-path-connectivity of the star graphs. Discret. Appl. Math. 357: 215-235 (2024)
• 
  Hengzhe Li, Menghan Ma, Jianbing Liu, Xiao Zhao:
  Addible edges in 2-matching-connected graphs and 3-matching-connected graphs. Discret. Appl. Math. 357: 274-281 (2024)
• 
  Ke Li, Zhao Zhang:
  PTASs for secure dominating set in planar graphs and growth-bounded graphs. Discret. Appl. Math. 357: 343-351 (2024)
• 
  Dazhi Lin, Tao Wang:
  A note on Alon-Tarsi number of Halin graphs. Discret. Appl. Math. 357: 297-299 (2024)
• 
  Chunmeng Liu, Jiang Zhou, Changjiang Bu:
  The high order spectral extremal results for graphs and their applications. Discret. Appl. Math. 357: 209-214 (2024)
• 
  Fred R. McMorris, Henry Martyn Mulder, Robert C. Powers:
  The weight balance function on trees. Discret. Appl. Math. 357: 66-73 (2024)
• 
  László F. Papp:
  Restricted optimal pebbling is NP-hard. Discret. Appl. Math. 357: 258-263 (2024)
• 
  Zeenath A. U., K. V. Lakshmy, Thomas W. Cusick, M. Sethumadhavan:
  Construction and enumeration of balanced rotation symmetric Boolean functions. Discret. Appl. Math. 357: 197-208 (2024)

skipping 6 more matches