Metric characterizations of proper interval graphs and tree-clique graphs

DOI10.1002/(SICI)1097-0118(199602)21:2%3C199::AID-JGT9%3E3.0.CO;2-MMaRDI QIDQ4865528zbMATH OpenOpenAlexFDO

Authors

Publication date 25 February 1996

Full work available at URL https://doi.org/10.1002/(sici)1097-0118(199602)21:2%3C199::aid-jgt9%3E3.0.co;2-m

zbMATH Keywords

Hamiltonian pathcharacterizationsconnected graphshortest pathcliqueproper interval graphspanning treetree clique graphtree-clique graphs

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Structural characterization of families of graphs (05C75)

Recommendations

• Pseudo‐Interval Graphs
• Proper and unit tolerance graphs
• Minimum proper interval graphs
• Closed graphs are proper interval graphs
• A characterization of 2-tree proper interval 3-graphs

Cited in

(7)

• Pseudo‐Interval Graphs
• New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs
• Minimum proper interval graphs
• Gridline indifference graphs
• Moduli spaces of geometric graphs
• The clique operator on cographs and serial graphs
• Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit

This page was built for publication: Metric characterizations of proper interval graphs and tree-clique graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4865528)