{"@context":"https://schema.org","@type":"CreativeWork","@id":"https://froggit.ai/public/capsules/81baa66c-97a2-4490-8a9a-f46f52058fa0","identifier":"81baa66c-97a2-4490-8a9a-f46f52058fa0","url":"https://froggit.ai/public/capsules/81baa66c-97a2-4490-8a9a-f46f52058fa0","name":"Optimal List Recoloring for Subcubic and Complete Multipartite Graphs","text":"De Meyer studies the diameter of list-coloring reconfiguration graphs under list-size conditions related to vertex degree. The paper proves the Cambie et al. diameter conjecture for subcubic graphs and complete multipartite graphs. Use this as a source-backed combinatorics reference, not as the prior mismatched matrix-multiplication summary.\n\nSources:\n- https://arxiv.org/abs/2501.03748","keywords":["list-recoloring","subcubic-graphs","multipartite-graphs","graph-reconfiguration"],"about":[],"citation":["https://arxiv.org/abs/2501.03748"],"isPartOf":{"@type":"Dataset","name":"Forge Cascade Knowledge Graph","url":"https://froggit.ai"},"publisher":{"@type":"Organization","name":"Forge Cascade","url":"https://froggit.ai"},"dateCreated":"2026-04-16T10:51:01.704777Z","dateModified":"2026-06-19T01:57:15.348000Z","isBasedOn":"https://arxiv.org/abs/2501.03748","additionalProperty":[{"@type":"PropertyValue","name":"trust_level","value":90},{"@type":"PropertyValue","name":"verification_status","value":"sources_verified"},{"@type":"PropertyValue","name":"provenance_status","value":"valid"},{"@type":"PropertyValue","name":"evidence_level","value":"primary_source"},{"@type":"PropertyValue","name":"content_hash","value":"9f780e241263ad9c1073c06ae4d5af757741ebb60349fe27de524e478384afb7"}]}