End simplicial vertices in path graphs
From MaRDI portal
Publication:274693
DOI10.7151/DMGT.1866zbMATH Open1334.05126OpenAlexW2333829738MaRDI QIDQ274693FDOQ274693
Authors: M. Gutierrez, Silvia B. Tondato 
Publication date: 25 April 2016
Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.7151/dmgt.1866
Recommendations
- End vertices in interval graphs
- Endpoint extendable paths in dense graphs
- Graph searches and their end vertices
- Graph Searches and Their End Vertices.
- Long paths with endpoints in given vertex-subsets of graphs
- End vertices of graph searches on bipartite graphs
- End-vertices of graph search algorithms
- Ends, tangles and critical vertex sets
- The end structure of a graph: Recent results and open problems
- scientific article; zbMATH DE number 4093496
Cites Work
- Intersection graphs of paths in a tree
- End vertices in interval graphs
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Characterizing path graphs by forbidden induced subgraphs
- On the tree representation of chordal graphs
- Representations of chordal graphs as subtrees of a tree
- Title not available (Why is that?)
Cited In (4)
This page was built for publication: End simplicial vertices in path graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q274693)
