scientific article; zbMATH DE number 7471109
From MaRDI portal
Publication:5026983
zbMath1482.05283MaRDI QIDQ5026983
Svetlana Poznanović, Eileen Melville, Beth Novick
Publication date: 8 February 2022
Full work available at URL: http://ajc.maths.uq.edu.au/pdf/81/ajc_v81_p339.pdf
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph operations (line graphs, products, etc.) (05C76)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Classifying coloring graphs
- The complexity of rerouting shortest paths
- Complexity of independent set reconfigurability problems
- \(1\)-perfectly orientable graphs and graph products
- On the parameterized complexity of reconfiguration problems
- On the complexity of reconfiguration problems
- Reconfiguration of list edge-colorings in a graph
- Shortest paths between shortest paths
- A little statistical mechanics for the graph theorist
- Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances
- Mixing 3-colourings in bipartite graphs
- Reconfiguration graphs of shortest paths
- The \(k\)-dominating graph
- Reconfiguration graphs for vertex colourings of chordal and chordal bipartite graphs
- Connectedness of the graph of vertex-colourings
- Matroid basis graphs. I
- Matroid basis graphs. II
- PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation
- Improved bounds for sampling colorings
- Finding paths between 3-colorings
- Pebbling in Hypercubes
- The Glauber Dynamics on Colorings of a Graph with High Girth and Maximum Degree
- A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph
- The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies
This page was built for publication:
