Separating subgraphs in k-trees: Cables and caterpillars
- 31 May 1984
- journal article
- Published by Elsevier in Discrete Mathematics
- Vol. 49 (3) , 275-285
- https://doi.org/10.1016/0012-365x(84)90164-x
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Recursive Graphs, Recursive Labelings and Shortest PathsSIAM Journal on Computing, 1981
- On simple characterizations of k-treesDiscrete Mathematics, 1974
- Trees with Hamiltonian squareMathematika, 1971
- Properties and characterizations of k ‐treesMathematika, 1971
- Incidence matrices and interval graphsPacific Journal of Mathematics, 1965