Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
From MaRDI portal
Publication:6496547
DOI10.1007/978-3-031-43380-1_11MaRDI QIDQ6496547
Unnamed Author, Unnamed Author, Katrin Casel, Davis Issac, Tobias Friedrich
Publication date: 3 May 2024
Cites Work
- Unnamed Item
- A linear-time algorithm for four-partitioning four-connected planar graphs
- A linear algorithm for bipartition of biconnected graphs
- Most uniform path partitioning and its use in image processing
- On the semi-perfect elimination
- Partitioning graphs to speedup Dijkstra's algorithm
- (Almost) Tight bounds and existence theorems for single-commodity confluent flows
- An Important Connection Between Network Motifs and Parsimony Models
- Algorithmic Aspects of Vertex Elimination on Graphs
- A homology theory for spanning tress of a graph
- Spanning Tree Congestion and Computation of Generalized Györi-Lovász Partition
- Research in Computational Molecular Biology
- Efficient algorithms for tripartitioning triconnected graphs and 3-edge-connected graphs
This page was built for publication: Efficient Constructions for the Győri-Lovász Theorem on Almost Chordal Graphs
