Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
From MaRDI portal
Publication:5954243
DOI10.1016/S0166-218X(01)00220-7zbMath0989.05104OpenAlexW2122459549WikidataQ127809717 ScholiaQ127809717MaRDI QIDQ5954243
Publication date: 22 July 2002
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/s0166-218x(01)00220-7
Extremal problems in graph theory (05C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (4)
Unnamed Item ⋮ Algorithms for graphs with small octopus ⋮ Tractabilities and intractabilities on geometric intersection graphs ⋮ Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a unique tree representation for \(P_ 4\)-extendible graphs
- A tree representation for \(P_ 4\)-sparse graphs
- On finding the minimum bandwidth of interval graphs
- Bandwidth of theta graphs with short paths
- The NP-completeness of the bandwidth minimization problem
- Hamiltonicity in graphs with few \(P_ 4\)'s
- Linear time optimization algorithms for \(P_ 4\)-sparse graphs
- Beyond NP-completeness for problems of bounded width (extended abstract)
- The Bandwidth Minimization Problem for Caterpillars with Hair Length 3 is NP-Complete
- Improved dynamic programming algorithms for bandwidth minimization and the MinCut Linear Arrangement problem
- Computing the Bandwidth of Interval Graphs
- Topological Bandwidth
- The bandwidth problem for graphs and matrices—a survey
- The Bandwidth of Caterpillars with Hairs of Length 1 and 2
- Recognizing $P_4 $-Sparse Graphs in Linear Time
- Complexity Results for Bandwidth Minimization
- Graph Classes: A Survey
- An $O( n \log n )$ Algorithm for Bandwidth of Interval Graphs
- P-Components and the Homogeneous Decomposition of Graphs
- Pathwidth, Bandwidth, and Completion Problems to Proper Interval Graphs with Small Cliques
- Approximating the bandwidth for asteroidal triple-free graphs
This page was built for publication: Bandwidth and topological bandwidth of graphs with few \(P_4\)'s
