Properties and characterizations of k ‐trees

DOI10.1112/S0025579300008500zbMath0221.05057MaRDI QIDQ5625203

Lowell W. Beineke, Raymond E. Pippert

Publication date: 1971

Published in: Mathematika (Search for Journal in Brave)

Mathematics Subject Classification ID

Trees (05C05)

Related Items

Characterization of partial 3-trees in terms of three structures, Cyclotomic and simplicial matroids, Characterization and Recognition of Partial 3-Trees, Structure of wheel-trees with colourings and domination numbers, Computing partial hypergraphs of bounded width, A kind of conditional connectivity of transposition networks generated by \(k\)-trees, A kind of conditional vertex connectivity of Cayley graphs generated by 2-trees, On the structure and deficiency of \(k\)-trees with bounded degree, Isomorphism testing of k-trees is in NC, for fixed k, Multidimensional bipartite trees, Matching preclusion and conditional matching preclusion for regular interconnection networks, Unnamed Item, Degree sets of k-trees: Small k, Intersection properties of boxes. II: Extremal families, Generating and counting unlabeled \(k\)-path graphs, Generalized loop‐erased random walks and approximate reachability, A characterization of \(k\)-trees, On the SPANNING \(k\)-TREE problem, On some strongly rigid families of graphs and the full embeddings they induce, Rigidity and the lower bound theorem. I, Linearly many faults in 2-tree-generated networks, Unnamed Item, MATCHING PRECLUSION FOR ALTERNATING GROUP GRAPHS AND THEIR GENERALIZATIONS, Characterizations of H-graphs, A characterization of 2-tree probe interval graphs, A clique-difference encoding scheme for labelled \(k\)-path graphs, Hamiltonian connectivity of 2-tree-generated networks, Simplicial matrix-tree theorems, \(k\)-Wiener index of a \(k\)-plex, Fault-tolerant Hamiltonian connectivity of \(2\)-tree-generated networks, Existence of graphs with a given set of r-neighborhoods, Separating subgraphs in k-trees: Cables and caterpillars, Interior graphs of maximal outerplane graphs, Efficient algorithms for combinatorial problems on graphs with bounded decomposability - a survey, The square of a chordal graph

Cites Work

• The number of labeled k-dimensional trees
• On the number of labeled 2-trees
• The number of labeled k-trees