Edge erasures and chordal graphs

Edge erasures and chordal graphs

<p class="p1">We prove several results about chordal graphs and weighted chordal graphs by focusing on exposed edges. These are edges that are properly contained in a single maximal complete subgraph.  This leads to a characterization of chordal graphs via deletions of a sequence of...

Full description

Bibliographic Details
Main Authors: Jared Culbertson, Dan P. Guralnik, Peter F. Stiller
Format: Article
Language:English
Published: Indonesian Combinatorial Society (InaCombS); Graph Theory and Applications (GTA) Research Centre; University of Newcastle, Australia; Institut Teknologi Bandung (ITB), Indonesia 2021-10-01
Series:Electronic Journal of Graph Theory and Applications
Subjects:
chordal graphs
exposed edges
edge erasures
minimum spanning trees
weighted graphs
kruskal's algorithm
Online Access:https://www.ejgta.org/index.php/ejgta/article/view/744

Internet

https://www.ejgta.org/index.php/ejgta/article/view/744

Similar Items