NeST graphs
From MaRDI portal
Publication:1613397
DOI10.1016/S0166-218X(01)00207-4zbMATH Open1003.05087OpenAlexW2914372882MaRDI QIDQ1613397FDOQ1613397
Authors: Ryan Hayward, Paul Kearney, 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
Recommendations
Cites Work
- Title not available (Why is that?)
- Edge and vertex intersection of paths in a tree
- Graph theory with applications
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Weakly triangulated graphs
- A recognition algorithm for the intersection graphs of paths in trees
- Neighborhood subtree tolerance graphs
- Title not available (Why is that?)
- Threshold tolerance graphs
- Topics on perfect graphs
- Tolerance graphs
- Proper and unit tolerance graphs
- Tolerance intersection graphs on binary trees with constant tolerance 3
- A Class of Balanced Matrices Arising from Location Problems
Cited In (8)
- Exact leaf powers
- Simplicial powers of graphs
- Pairwise compatibility graphs: a survey
- Simplicial Powers of Graphs
- Superiso relic v4: a program for calculating dark matter and flavour physics observables in supersymmetry
- Rooted directed path graphs are leaf powers
- Net Tape Graphs
- The noncommutative Lorentzian cylinder as an isospectral deformation
This page was built for publication: NeST graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1613397)
