Mixing 3-Colourings in Bipartite Graphs (Q3508565): Difference between revisions
From MaRDI portal
Set OpenAlex properties. |
ReferenceBot (talk | contribs) Changed an Item |
||
Property / cites work | |||
Property / cites work: Q3324796 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Connectedness of the graph of vertex-colourings / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4507228 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Random sampling of 3‐colorings in ℤ<sup>2</sup> / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A very simple algorithm for estimating the number of k‐colorings of a low‐degree graph / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4798347 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Computational complexity of compaction to irreflexive cycles / rank | |||
Normal rank |
Latest revision as of 12:58, 28 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Mixing 3-Colourings in Bipartite Graphs |
scientific article |
Statements
Mixing 3-Colourings in Bipartite Graphs (English)
0 references
1 July 2008
0 references