NeST graphs

DOI10.1016/S0166-218X(01)00207-4zbMath1003.05087OpenAlexW2914372882MaRDI QIDQ1613397

Paul E. Kearney, Ryan B. Hayward, Andrew J. Malton

Publication date: 29 August 2002

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00207-4

zbMATH Keywords

chordal graphsinterval graphthreshold graphtolerance graphneighborhood subtree tolerance

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

Related Items

Pairwise Compatibility Graphs: A Survey ⋮ The noncommutative Lorentzian cylinder as an isospectral deformation ⋮ Superiso relic v4: a program for calculating dark matter and flavour physics observables in supersymmetry ⋮ Rooted directed path graphs are leaf powers ⋮ Exact leaf powers ⋮ Simplicial powers of graphs ⋮ Simplicial Powers of Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Topics on perfect graphs
• Tolerance graphs
• Weakly triangulated graphs
• Edge and vertex intersection of paths in a tree
• A recognition algorithm for the intersection graphs of paths in trees
• Neighborhood subtree tolerance graphs
• Proper and unit tolerance graphs
• Tolerance intersection graphs on binary trees with constant tolerance 3
• The intersection graphs of subtrees in trees are exactly the chordal graphs
• A Class of Balanced Matrices Arising from Location Problems
• Threshold tolerance graphs