The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
From MaRDI portal
(Redirected from Publication:6606223)
Cites work
- A note on alternating cycles in edge-coloured graphs
- Alternating cycles and paths in edge-coloured multigraphs: A survey
- Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
- Alternating paths in edge-colored complete graphs
- Characterizations of graphs having large proper connection numbers
- Chromatic scheduling and frequency assignment
- Exponential Time Complexity of the Permanent and the Tutte Polynomial
- Finding paths in graphs avoiding forbidden transitions
- Fine-Grained Reductions from Approximate Counting to Decision
- Graph theory
- Graph theory with applications
- Hardness results for three kinds of colored connections of graphs
- scientific article; zbMATH DE number 762736 (Why is no real title available?)
- Inapproximability of the Tutte polynomial
- Julius Petersen's theory of regular graphs
- Minimum degree condition for proper connection number 2
- Models and solution techniques for frequency assignment problems
- On proper-path colorings in graphs
- On the (di)graphs with (directed) proper connection number two
- On the complexity of k-SAT
- On the number of \(k\)-proper connected edge and vertex colorings of graphs
- Paths and trails in edge-colored graphs
- Paths, Trees, and Flowers
- Proper connection number of random graphs
- Proper connection of graphs
- Proper connection with many colors
- Rainbow connection in graphs
- Random generation of combinatorial structures from a uniform distribution
- The complexity of counting self-avoiding walks in subgraphs of two-dimensional grids and hypercubes.
- The Factors of Graphs
- The method of alternating paths
- The rainbow connectivity of a graph
- The theory of regular graphs
- Which problems have strongly exponential complexity?
- Zur allgemeinen Kurventheorie.
This page was built for publication: The fine-grained complexity of approximately counting proper connected colorings (extended abstract)
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6606223)
