End simplicial vertices in path graphs

DOI10.7151/DMGT.1866MaRDI QIDQ274693zbMATHOpenAlexFDO

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

zbMATH Keywords

chordal graphsclique treespath graphs

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75)

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

• scientific article; zbMATH DE number 751126 (Why is no real title available?)
• Characterizing path graphs by forbidden induced subgraphs
• End vertices in interval graphs
• Intersection graphs of paths in a tree
• On the tree representation of chordal graphs
• Representations of chordal graphs as subtrees of a tree
• The intersection graphs of subtrees in trees are exactly the chordal graphs

Cited in

(4)

• DV-model that can be rooted
• End vertices in containment interval graphs
• End vertices in interval graphs
• Ends, tangles and critical vertex sets

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)