Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (Q6055514): Difference between revisions

Latest revision as of 00:55, 3 August 2024

scientific article; zbMATH DE number 7743995

Language	Label	Description	Also known as
English	Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs	scientific article; zbMATH DE number 7743995

Statements

instance of

scholarly article

0 references

title

Chromatic number of a line with geometric progressions of forbidden distances and the complexity of recognizing distance graphs (English)

0 references

author

Georgy Sokolov

0 references

published in

Moscow Journal of Combinatorics and Number Theory

0 references

publication date

29 September 2023

0 references

zbMATH Keywords

distance graph

0 references

chromatic number

0 references

computation complexity

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.2140/moscow.2023.12.247

0 references

cites work

On the chromatic number of a distance graph associated with a lacunary sequence

0 references

Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms

0 references

Q5808059

0 references

Distance graphs and \(T\)-coloring

0 references

Colouring the real line

0 references

Colouring prime distance graphs

0 references

The chromatic number of the plane is at least 5

0 references

On the complexity of H-coloring

0 references

On the chromatic number of an infinitesimal plane layer

0 references

Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence

0 references

All finite sets are Ramsey in the maximum norm

0 references

Distance Graphs Generated by Five Primes (Research)

0 references

Graph homomorphisms with infinite targets

0 references

Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation

0 references

Coloring Distance Graphs and Graphs of Diameters

0 references

Q3464534

0 references

On complexity of multidistance graph recognition in \(\mathbb{R}^1\)

0 references

Chromatic number of prime distance graphs

0 references

Identifiers

zbMATH Open document ID

1521.05048

0 references

DOI

10.2140/moscow.2023.12.247

0 references

Mathematics Subject Classification ID

0 references

0 references

0 references

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:6055514

@@ Property / cites work @@
+On the chromatic number of a distance graph associated with a lacunary sequence
+Normal rank
@@ Property / cites work @@
+Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
+Normal rank
@@ Property / cites work @@
+Q5808059
@@ Property / cites work: Q5808059 / rank @@
+Normal rank
@@ Property / cites work @@
+Distance graphs and \(T\)-coloring
@@ Property / cites work: Distance graphs and \(T\)-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring the real line
@@ Property / cites work: Colouring the real line / rank @@
+Normal rank
@@ Property / cites work @@
+Colouring prime distance graphs
@@ Property / cites work: Colouring prime distance graphs / rank @@
+Normal rank
@@ Property / cites work @@
+The chromatic number of the plane is at least 5
@@ Property / cites work: The chromatic number of the plane is at least 5 / rank @@
+Normal rank
@@ Property / cites work @@
+On the complexity of H-coloring
@@ Property / cites work: On the complexity of H-coloring / rank @@
+Normal rank
@@ Property / cites work @@
+On the chromatic number of an infinitesimal plane layer
+Normal rank
@@ Property / cites work @@
+Chromatic numbers of Cayley graphs on \(\mathbb Z\) and recurrence
+Normal rank
@@ Property / cites work @@
+All finite sets are Ramsey in the maximum norm
@@ Property / cites work: All finite sets are Ramsey in the maximum norm / rank @@
+Normal rank
@@ Property / cites work @@
+Distance Graphs Generated by Five Primes (Research)
+Normal rank
@@ Property / cites work @@
+Graph homomorphisms with infinite targets
@@ Property / cites work: Graph homomorphisms with infinite targets / rank @@
+Normal rank
@@ Property / cites work @@
+Two Erdős problems on lacunary sequences: Chromatic number and Diophantine approximation
+Normal rank
@@ Property / cites work @@
+Coloring Distance Graphs and Graphs of Diameters
@@ Property / cites work: Coloring Distance Graphs and Graphs of Diameters / rank @@
+Normal rank
@@ Property / cites work @@
+Q3464534
@@ Property / cites work: Q3464534 / rank @@
+Normal rank
@@ Property / cites work @@
+On complexity of multidistance graph recognition in \(\mathbb{R}^1\)
+Normal rank
@@ Property / cites work @@
+Chromatic number of prime distance graphs
@@ Property / cites work: Chromatic number of prime distance graphs / rank @@
+Normal rank