Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Hell, Pavol
1974.
On some strongly rigid families of graphs and the full embeddings they induce.
Algebra Universalis,
Vol. 4,
Issue. 1,
p.
108.
Duke, Richard A.
and
Winkler, Peter M.
1981.
Degree sets ofk-trees: Smallk.
Israel Journal of Mathematics,
Vol. 40,
Issue. 3-4,
p.
296.
Burr, Stefan A.
and
Duke, Richard A.
1981.
Ramsey numbers for certain k-graphs.
Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics,
Vol. 30,
Issue. 3,
p.
284.
Winkler, Peter M
1983.
Existence of graphs with a given set of r-neighborhoods.
Journal of Combinatorial Theory, Series B,
Vol. 34,
Issue. 2,
p.
165.
Proskurowski, Andrzej
1984.
Separating subgraphs in k-trees: Cables and caterpillars.
Discrete Mathematics,
Vol. 49,
Issue. 3,
p.
275.
Hedetniemi, Sandra M
Proskurowski, Andrzej
and
Sysło, Maciej M
1985.
Interior graphs of maximal outerplane graphs.
Journal of Combinatorial Theory, Series B,
Vol. 38,
Issue. 2,
p.
156.
Arnborg, Stefan
1985.
Efficient algorithms for combinatorial problems on graphs with bounded decomposability — A survey.
BIT,
Vol. 25,
Issue. 1,
p.
1.
Arnborg, Stefan
and
Proskurowski, Andrzej
1986.
Characterization and Recognition of Partial 3-Trees.
SIAM Journal on Algebraic Discrete Methods,
Vol. 7,
Issue. 2,
p.
305.
Kajitani, Yoji
Ishizuka, Akio
and
Ueno, Shuichi
1986.
Characterization of partial 3-trees in terms of three structures.
Graphs and Combinatorics,
Vol. 2,
Issue. 1,
p.
233.
Chandrasekharan, N.
and
Iyengar, S.S.
1988.
NC algorithms for recognizing chordal graphs and k trees.
IEEE Transactions on Computers,
Vol. 37,
Issue. 10,
p.
1178.
Satyanarayana, A.
and
Tung, L.
1990.
A characterization of partial 3‐trees.
Networks,
Vol. 20,
Issue. 3,
p.
299.
Chandrasekharan, N.
1990.
Isomorphism testing of k-trees is in NC, for fixed k.
Information Processing Letters,
Vol. 34,
Issue. 6,
p.
283.
Dai, W.W.-M.
and
Sato, M.
1990.
Minimal forbidden minor characterization of planar partial 3-trees and application to circuit layout.
p.
2677.
Eckhoff, Jürgen
1991.
Intersection properties of boxes part II: Extremal families.
Israel Journal of Mathematics,
Vol. 73,
Issue. 2,
p.
129.
Fröberg, Ralf
1992.
A characterization of k-trees.
Discrete Mathematics,
Vol. 104,
Issue. 3,
p.
307.
McKee, Terry A.
and
Scheinerman, Edward R.
1993.
On the chordality of a graph.
Journal of Graph Theory,
Vol. 17,
Issue. 2,
p.
221.
Eckhoff, Jürgen
1993.
Extremal interval graphs.
Journal of Graph Theory,
Vol. 17,
Issue. 1,
p.
117.
Cai, Leizhen
and
Maffray, Frédéric
1993.
On the SPANNING k-TREE problem.
Discrete Applied Mathematics,
Vol. 44,
Issue. 1-3,
p.
139.
Harary, Frank
and
McKee, Terry A.
1994.
The square of a chordal graph.
Discrete Mathematics,
Vol. 128,
Issue. 1-3,
p.
165.
1994.
References.
Discrete Applied Mathematics,
Vol. 54,
Issue. 2-3,
p.
281.