default search action
Discrete Mathematics, Volume 272
Volume 272, Number 1, October 2003
- Frank Harary:
Preface. 1-2 - Guest Editors. Discret. Math. 272(1): 3- (2003)
- Nawarat Ananchuen, Michael D. Plummer:
Some results related to the toughness of 3-domination critical graphs. 5-15 - Lowell W. Beineke, Raymond E. Pippert:
Multidimensional bipartite trees. 17-26 - Jens-P. Bode, Heiko Harborth:
Independence for knights on hexagon and triangle boards. 27-35 - Gary Chartrand, Ladislav Nebesky, Ping Zhang:
Greedy F-colorings of graphs. 37-46 - Ronald D. Dutton, Robert C. Brigham, Chao Gui:
Edge-recognizable domination numbers. 47-51 - Paul Erdös, Stephen T. Hedetniemi, Renu C. Laskar, Geert C. E. Prins:
On the equality of the partial Grundy and upper ochromatic numbers of graphs. 53-64 - Teresa W. Haynes, Michael A. Henning
:
Changing and unchanging domination: a classification. 65-79 - Robert E. Jamison, Fred R. McMorris, Henry Martyn Mulder
Graphs with only caterpillars as spanning trees. 81-95 - Khee Meng Koh, Bock Boom Lim, Peter J. Slater:
H-domination in graphs. 97-105 - Brendan D. McKay
The asymptotic number of claw-free cubic graphs. 107-118 - Hanumappa B. Walikar, Fred Buckley, M. K. Itagi:
Radius-edge-invariant and diameter-edge-invariant graphs. 119-126
Volume 272, Number 2-3, November 2003
- Charles Curtis Lindner, Christopher A. Rodger:
A connection between varieties of quasigroups and graph decompositions. 127-137 - John G. Gimbel, Chris Hartman:
Subcolorings and the subchromatic number of a graph. 139-154 - Yanxun Chang, Giovanni Lo Faro
The existence of directed BIBDs. 155-169 - Gary Chartrand, Teresa W. Haynes, Michael A. Henning
Stratification and domination in graphs. 171-185 - Ervin Györi, Vladimir Nikiforov, Richard H. Schelp:
Nearly bipartite graphs. 187-196 - Gejza Jenca
Finite homogeneous and lattice ordered effect algebras. 197-214 - S. Ole Warnaar
The generalized Borwein conjecture. II. Refined q-trinomial coefficients. 215-258 - Amitava Bhattacharya:
On a conjecture of Manickam and Singhi. 259-261 - Bostjan Bresar, Blaz Zmazek:
On the independence graph of a graph. 263-268 - Keith Edwards:
Edge decomposition of complete tripartite graphs. 269-275 - Gennian Ge, J. Wang, Rolf S. Wei:
MGDD with block size 4 and its application to sampling designs. 277-283 - Sylvain Gravier, Chính T. Hoàng, Frédéric Maffray:
Coloring the hypergraph of maximal cliques of a graph with no long path. 285-290 - S. K. Gupta, Pankaj Mangal, Vineet Paliwal:
Some work towards the proof of the reconstruction conjecture. 291-296 - Robert E. Jamison, Peter D. Johnson Jr.:
The structure of (t, r)-regular graphs of large order. 297-300
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-11-11 02:13 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: