• 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 64 matches

• 2013
• 
  Kinnari Amin, Jill R. Faudree, Ronald J. Gould, Elzbieta Sidorowicz:
  On the non-(p-1)-partite K_p-free graphs. Discuss. Math. Graph Theory 33(1): 9-23 (2013)
• 
  Hamideh Aram, S. Norouzian, Seyed Mahmoud Sheikholeslami, Lutz Volkmann:
  The distance Roman domination numbers of graphs. Discuss. Math. Graph Theory 33(4): 717-730 (2013)
• 
  Jernej Azarija:
  Sharp uppper and lower bounds on the number of spanning trees in Cartesian product graphs. Discuss. Math. Graph Theory 33(4): 785-790 (2013)
• 
  József Balogh, Alexandr V. Kostochka, Andrei M. Raigorodskii:
  Coloring some finite sets in Rⁿ . Discuss. Math. Graph Theory 33(1): 25-31 (2013)
• 
  Allan Bickle:
  Two short proofs on total domination. Discuss. Math. Graph Theory 33(2): 457-459 (2013)
• 
  Mostafa Blidia, Nacéra Meddah:
  A characterization of trees for new lower bound on the k-independence number. Discuss. Math. Graph Theory 33(2): 395-410 (2013)
• 
  Oleg V. Borodin, Anna O. Ivanova:
  Precise upper bound for the strong edge chromatic number of sparse planar graphs. Discuss. Math. Graph Theory 33(4): 756-770 (2013)
• 
  Izak Broere, Johannes Heidema:
  Universality for and in induced-hereditary graph properties. Discuss. Math. Graph Theory 33(1): 33-47 (2013)
• 
  Izak Broere, Johannes Heidema, Peter Mihók:
  Universality in graph properties with degree restrictions. Discuss. Math. Graph Theory 33(3): 477-492 (2013)
• 
  Izak Broere, Peter Mihók:
  Hereditarnia. Discuss. Math. Graph Theory 33(1): 7- (2013)
• 
  Enrique Casas-Bautista, Hortensia Galeana-Sánchez, Rocío Rojas-Monroy:
  γ-cycles and transivity by monochromatic paths in arc-coloured digraphs. Discuss. Math. Graph Theory 33(3): 493-507 (2013)
• 
  Mustapha Chellali, Nader Jafari Rad:
  Strong equality between the Roman domination and independent Roman domination numbers in trees. Discuss. Math. Graph Theory 33(2): 337-346 (2013)
• 
  Xiang'en Chen, Yuping Gao, Bing Yao:
  Vertex-distinguishing IE-total colorings of complete bipartite graphs K_{m, n}(m<n). Discuss. Math. Graph Theory 33(2): 289-306 (2013)
• 
  V. Chitra, Appu Muthusamy:
  Symmetric Hamilton cycle decompositions of complete multigraphs. Discuss. Math. Graph Theory 33(4): 695-707 (2013)
• 
  Július Czap, Peter Mihók:
  Fractional Q-coloring of graphs. Discuss. Math. Graph Theory 33(3): 509-519 (2013)
• 
  Július Czap, Zsolt Tuza:
  Decompositions of plane graphs under parity constrains given by faces. Discuss. Math. Graph Theory 33(3): 521-530 (2013)
• 
  Ewa Drgas-Burchardt:
  A note on the uniqueness of stable marriage matching. Discuss. Math. Graph Theory 33(1): 49-55 (2013)
• 
  Ewa Drgas-Burchardt, Mariusz Haluszczak, Maria Kwasnik, Danuta Michalak, Elzbieta Sidorowicz:
  Preface. Discuss. Math. Graph Theory 33(1): 5-6 (2013)
• 
  Ewa Drgas-Burchardt, Elzbieta Sidorowicz:
  Preface. Discuss. Math. Graph Theory 33(3): 475- (2013)
• 
  Ronald D. Dutton, William Klostermeyer:
  Edge dominating sets and vertex covers. Discuss. Math. Graph Theory 33(2): 437-456 (2013)
• 
  Reinhardt Euler, Pawel Oleksik:
  When is an incomplete 3× n latin rectangle completable?. Discuss. Math. Graph Theory 33(1): 57-69 (2013)
• 
  Reinhardt Euler, Pawel Oleksik, Zdzislaw Skupien:
  Counting maximal distance-independent sets in grid graphs. Discuss. Math. Graph Theory 33(3): 531-557 (2013)
• 
  Igor Fabrici, Erhard Hexel, Stanislav Jendrol':
  On vertices enforcing a Hamiltonian cycle. Discuss. Math. Graph Theory 33(1): 71-89 (2013)
• 
  Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
  Weak saturation numbers for sparse graphs. Discuss. Math. Graph Theory 33(4): 677-693 (2013)
• 
  Odile Favaron:
  The b-domatic number of a graph. Discuss. Math. Graph Theory 33(4): 747-757 (2013)
• 
  Anna Fiedorowicz:
  Acyclic 6-coloring of graphs with maximum degree 5 and small maximum average degree. Discuss. Math. Graph Theory 33(1): 91-99 (2013)
• 
  Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, Adam Pawel Wojda:
  On minimum (K_q, k) stable graphs. Discuss. Math. Graph Theory 33(1): 101-115 (2013)
• 
  Marietjie Frick:
  A survey of the Path Partition Conjecture. Discuss. Math. Graph Theory 33(1): 117-131 (2013)
• 
  Marietjie Frick, Joy Singleton, Susan A. van Aardt:
  Independent detour transwersals in 3-deficient digraphs. Discuss. Math. Graph Theory 33(2): 261-275 (2013)
• 
  Shinya Fujita, Henry Liu:
  The balanced decomposition number of TK₄ and series -parallel graphs. Discuss. Math. Graph Theory 33(2): 347-359 (2013)

skipping 34 more matches