default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 170
Volume 170, Numbers 1-3, June 1997
- Nawarat Ananchuen, Lou Caccetta:
Matching extension and minimum degree. 1-13 - Frank E. Bennett, Ruizhong Wei:
The existence of Schröder designs with equal-sized holes. 15-28 - Mira Bernstein, Neil J. A. Sloane, Paul E. Wright:
On sublattices of the hexagonal lattice. 29-39 - Béla Bollobás, Alex D. Scott:
Independent sets and repeated degrees. 41-49 - Isma Bouchemakh
, Konrad Engel:
The order-interval hypergraph of a finite poset and the König property. 51-61 - Gary Chartrand, Héctor Hevia, Elzbieta B. Jarrett, Michelle Schultz:
Subgraph distances in graphs defined by edge transfers. 63-79 - Davide Crippa, Klaus Simon:
q-distributions and Markov processes. 81-98 - Jitender S. Deogun, Dieter Kratsch, George Steiner:
1-Tough cocomparability graphs are hamiltonian. 99-106 - Kequan Ding:
Rook placements and cellular decomposition of partition varieties. 107-151 - Ali Ridha Mahjoub:
On perfectly two-edge connected graphs. 153-172 - William P. Miller:
Techniques in matroid reconstruction. 173-183 - Hunter S. Snevily:
New families of graphs that have alpha-labelings. 185-194 - B. Wei:
Longest cycles in 3-connected graphs. 195-201 - László Lipták:
Sperner systems containing at most k sets of every cardinality. 203-209 - Elena Barcucci, Alberto Del Lungo, S. Fezzi, Renzo Pinzani:
Nondecreasing Dyck paths and q-Fibonacci numbers. 211-217 - Thomas Böhme, Hajo Broersma, F. Göbel, Alexandr V. Kostochka, Michael Stiebitz:
Spanning trees with pairwise nonadjacent endvertices. 219-222 - Chiuyuan Chen, Chin-Chen Chang, Gerard J. Chang:
Proper interval graphs and the guard problem. 223-230 - Guantao Chen, Richard H. Schelp, Warren E. Shreve:
A special k-coloring for a connected k-chromatic graph. 231-236 - Arkady A. Chernyak, Zhanna A. Chernyak:
r-Multihypergraphs with prescribed edge degree sequences. 237-240 - David Coulson:
An 18-colouring of 3-space omitting distance one. 241-247 - Paul Erdös, László Pyber:
Covering a graph by complete bipartite graphs. 249-251 - Sylvain Gravier:
Hamiltonicity of the cross product of two Hamiltonian graphs. 253-257 - Michael Krivelevich:
Almost perfect matchings in random uniform hypergraphs. 259-263 - Yusheng Li, Cecil C. Rousseau:
On the Ramsey number r(H+K_n, Kn). 265-267 - Yusheng Li, Cecil C. Rousseau, Lubomír Soltés:
Ramsey linear families and generalized subdivided graphs. 269-275 - Jiping Liu, Huishan Zhou:
Maximum induced matchings in graphs. 277-281 - Kevin McDougal:
A generalization of Ryser's theorem on term rank. 283-288 - Victor Neumann-Lara:
Vertex critical 4-dichromatic circulant tournaments. 289-291 - Christina Zamfirescu:
Cyclic and cliquewise connectedness of line graphs. 293-297
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-08 20:20 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:
