An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (Q3010389): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
| Property / cites work | |||
| Property / cites work: Finding paths between graph colourings: PSPACE-completeness and superpolynomial distances / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: List edge and list total colourings of multigraphs / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: The Connectivity of Boolean Satisfiability: Computational and Structural Dichotomies / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: PSPACE-completeness of sliding-block puzzles and other problems through the nondeterministic constraint logic model of computation / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: On the complexity of reconfiguration problems / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Reconfiguration of List Edge-Colorings in a Graph / rank | |||
Normal rank | |||
Latest revision as of 06:45, 4 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree |
scientific article |
Statements
An Improved Sufficient Condition for Reconfiguration of List Edge-Colorings in a Tree (English)
0 references
1 July 2011
0 references
0 references
