The following pages link to Bandwidth of chain graphs (Q293476):
Displaying 22 items.
- An exponential time 2-approximation algorithm for bandwidth (Q392018) (← links)
- Permutation bigraphs and interval containments (Q401140) (← links)
- Bandwidth of convex bipartite graphs and related graphs (Q436544) (← links)
- A note on maximum differential coloring of planar graphs (Q473207) (← links)
- Minimal classes of graphs of unbounded clique-width (Q659655) (← links)
- Bounds on mincut for Cayley graphs over Abelian groups (Q733724) (← links)
- Graph bandwidth of weighted caterpillars (Q860873) (← links)
- Bichain graphs: geometric model and universal graphs (Q896651) (← links)
- Bandwidth of bipartite permutation graphs in polynomial time (Q1044045) (← links)
- Tractabilities and intractabilities on geometric intersection graphs (Q1736543) (← links)
- The maximum binary tree problem (Q2041978) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q2150586) (← links)
- Algorithmic aspects of upper paired-domination in graphs (Q2283034) (← links)
- Linear structure of bipartite permutation graphs and the longest path problem (Q2379947) (← links)
- ON COMPUTING LONGEST PATHS IN SMALL GRAPH CLASSES (Q3065608) (← links)
- ACYCLIC MATCHINGS IN SUBCLASSES OF BIPARTITE GRAPHS (Q4903635) (← links)
- Secure total domination in chain graphs and cographs (Q4956172) (← links)
- BIPARTITE GRAPHS TOTALLY DECOMPOSABLE BY CANONICAL DECOMPOSITION (Q5249025) (← links)
- Bandwidth of Bipartite Permutation Graphs in Polynomial Time (Q5458530) (← links)
- The Maximum Binary Tree Problem. (Q5874498) (← links)
- Roman \(\{3\}\)-domination in graphs: complexity and algorithms (Q6558691) (← links)
- Hardness results of connected power domination for bipartite graphs and chordal graphs (Q6610089) (← links)
