The degree-preserving spanning tree problem in strongly chordal and directed path graphs

DOI10.1002/NET.20359zbMath1208.05142OpenAlexW4247252135MaRDI QIDQ3057180

Ching-Chi Lin, Gen-Huey Chen, Gerard Jennhwa Chang

Publication date: 24 November 2010

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.20359

zbMATH Keywords

algorithmplanar graphstrongly chordal graphdirected path graphdegree-preserving spanning tree

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

Related Items (1)

Spanning trees with disjoint dominating and 2-dominating sets

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Characterizations of strongly chordal graphs
• Degree-preserving spanning trees in small-degree graphs
• Doubly lexical ordering of dense 0--1 matrices
• The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
• Three Partition Refinement Algorithms
• Efficiency of a Good But Not Linear Set Union Algorithm
• Efficient Algorithms for the Domination Problems on Interval and Circular-Arc Graphs
• On Local Search and Placement of Meters in Networks

This page was built for publication: The degree-preserving spanning tree problem in strongly chordal and directed path graphs