On the chromatic number of Toeplitz graphs (Q496679): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Efficiently solvable special cases of bottleneck travelling salesman problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian properties of Toeplitz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Colouring the real line / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterizing bipartite Toeplitz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Coloring planar Toeplitz graphs and the stable set polytope. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On hamiltonian Toeplitz graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On planarity and colorability of circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3410615 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex-colouring of 3-chromatic circulant graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles and paths in distance graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: 4-colorable 6-regular toroidal graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Circular chromatic number of distance graphs with distance sets of cardinality 3 / rank
 
Normal rank

Latest revision as of 18:52, 10 July 2024

scientific article
Language Label Description Also known as
English
On the chromatic number of Toeplitz graphs
scientific article

    Statements

    Identifiers