All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

Filters

88 895 (0,15s)

Result

On distance local connectivity and vertex distance colouring

graph with large diameter. We study some relationships between t-distance chromatic number and distance local connectivity of a graph and give an upper bound on the t-distance chromatic numbe...

BA - Obecná matematika

  • 2007
  • Jx
Result

Coloring the distance graphs

Let n⩾ 1 be a number. Let Γ n be the graph on Rn connecting points of rational Euclidean distance. It is consistent with choiceless set theory ZF+DC that Γ n has countable chromatic number, yet the chromatic

Pure mathematics

  • 2023
  • Jimp
  • Link
Result

Packing chromatic number of distance graphs

-i have pairwise distance greater than i. We study the packing chromatic number of infinite distance graphs G(Z. D), i.e., graphs with the set Z of integers as vertex setThe packing chromatic number

BA - Obecná matematika

  • 2012
  • Jx
  • Link
Result

A note on packing chromatic number of the square lattics

vertices in X_i have pairwise distance greater than i. In this note we improve the upper bound on the packing chromatic number of the square lattice.The concept of a packing colouring is related to a frequency assignment p...

BA - Obecná matematika

  • 2010
  • Jx
Result

S-packing colorings of distance graphs G(Z,{2,t})

The smallest k such that G has an S-packing k-coloring is the S-packing chromatic number of G. The S-packing chromatic numbers of the graphs G(Z,{2,t}), where S is any sequence with a(i) is an element of {1, 2} for...

Pure mathematics

  • 2021
  • Jimp
  • Link
Result

The packing coloring of distance graphs D(k, t)

The packing chromatic number $chi_{rho}(G)$ of a graph $G$ is the smallest integer $p$ such that vertices of $G$ can be partitioned into disjoint classes $X_{1}, ..., X_{p}$ where vertices in $X_{i}$ have pairwise distance ...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
Result

Packing coloring of hypercubes with extended Hamming codes

vertices of color c are at distance at least c + 1. The minimum value k such that G admits a packing k-coloring is called the packing chromatic number of G. In this paper, we continue the study of the packing chromatic...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2024
  • Jimp
  • Link
Result

On S-packing Colourings of Distance Graph D(1,t) and D(1,2,t)

-packing chromatic number of infinite distance graphs with distance set D = {1, t} , t-packing chromatic number x_S(G) of a graph G is the smallest integer k vertices in X_i are pairwise at di...

Pure mathematics

  • 2023
  • Jimp
  • Link
Result

t-Strong Cliques and the Degree-Diameter Problem

in a vertex of f. The distance-t chromatic index of G is the chromatic number of L(G)(t for the distance-t chromatic index and t-strong clique are problems related to two famous problems: the con...

Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

  • 2021
  • Jimp
  • Link
Result

The distance-t chromatic index of graphs

We obtain two results for the distance-t chromatic index of graphs of maximum degree D. The first one is an upper bound of (2-epsilon)D^t, where epsilon is a constant independent of t. The second result is an improved upper bound fo...

BA - Obecná matematika

  • 2014
  • Jx
  • Link
  • 1 - 10 out of 88 895