Reconfiguration of Spanning Trees with Many or Few Leaves
From MaRDI portal
(Redirected from Publication:5874492)
Cites work
- A survey on the use of Markov chains to randomly sample colourings
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Introduction to reconfiguration
- On the complexity of reconfiguration problems
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Reconfiguration in bounded bandwidth and tree-depth
- Reconfiguration of Minimum Steiner Trees via Vertex Exchanges
- Shortest reconfiguration of matchings
- Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
- The coloring reconfiguration problem on specific graph classes
- The complexity of change
- The complexity of dominating set reconfiguration
- Token sliding on chordal graphs
- Token sliding on split graphs
Cited in
(11)- Reconfiguration of spanning trees with degree constraints or diameter constraints
- Feedback vertex set reconfiguration in planar graphs
- A Simple 2-Approximation for Maximum-Leaf Spanning Tree
- Brief announcement: Distributed reconfiguration of spanning trees
- How far is my network from being edge-based? Proximity measures for edge-basedness of unrooted phylogenetic networks
- Reconfiguration of time-respecting arborescences
- Reconfiguration of time-respecting arborescences
- Reconfiguration of plane trees in convex geometric graphs
- Reconfiguration of the union of arborescences
- Reconfiguration of the union of arborescences
- Spanning trees for many different numbers of leaves
This page was built for publication: Reconfiguration of Spanning Trees with Many or Few Leaves
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5874492)
