Metric characterizations of proper interval graphs and tree-clique graphs
From MaRDI portal
Publication:4865528
DOI<199::AID-JGT9>3.0.CO;2-M 10.1002/(SICI)1097-0118(199602)21:2<199::AID-JGT9>3.0.CO;2-MzbMath0843.05085OpenAlexW4238081147MaRDI QIDQ4865528
No author found.
Publication date: 25 February 1996
Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199602)21:2<199::aid-jgt9>3.0.co;2-m
shortest pathcharacterizationsspanning treecliqueconnected graphHamiltonian pathproper interval graphtree clique graphtree-clique graphs
Related Items (4)
Gridline indifference graphs ⋮ Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit ⋮ The clique operator on cographs and serial graphs ⋮ New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
This page was built for publication: Metric characterizations of proper interval graphs and tree-clique graphs