Bounding width on graph classes of constant diameter
From MaRDI portal
Cites work
- 3-coloring C₄ or C₃-free diameter two graphs
- A Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
- A Ramsey-type theorem for traceable graphs
- Algorithms and almost tight results for 3-colorability of small diameter graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- Clique-width for hereditary graph classes
- Colouring graphs of bounded diameter in the absence of small cycles
- Diameter and treewidth in minor-closed graph families
- Equivalence of local treewidth and linear local treewidth and its algorithmic applications
- Faster 3-coloring of small-diameter graphs
- Graph minors. III. Planar tree-width
- Graph minors. V. Excluding a planar graph
- scientific article; zbMATH DE number 6678444 (Why is no real title available?)
- scientific article; zbMATH DE number 1979486 (Why is no real title available?)
- scientific article; zbMATH DE number 3232670 (Why is no real title available?)
- Induced subgraphs and path decompositions
- Linear time solvable optimization problems on graphs of bounded clique-width
- Minor-Closed Graph Classes with Bounded Layered Pathwidth
- On the power of tree-depth for fully polynomial FPT algorithms
- Quickly excluding a forest
- Sparsity. Graphs, structures, and algorithms
- The complexity landscape of decompositional parameters for ILP
- The computational complexity of disconnected cut and \(2 K_2\)-partition
- The mixed Chinese postman problem parameterized by pathwidth and treedepth
- The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
- Tree-width dichotomy
- Upper bounds to the clique width of graphs
This page was built for publication: Bounding width on graph classes of constant diameter
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7294428)
