Results 1 to 10 of about 649 (172)

Improper colouring of (random) unit disk graphs [PDF]

open access: diamondDiscrete Mathematics & Theoretical Computer Science, 2005
For any graph $G$, the $k$-improper chromatic number $χ ^k(G)$ is the smallest number of colours used in a colouring of $G$ such that each colour class induces a subgraph of maximum degree $k$.
Ross J. Kang   +2 more
doaj   +2 more sources

On \delta^(k)-colouring of Powers of Paths and Cycles

open access: yesTheory and Applications of Graphs, 2021
In a proper vertex colouring of a graph, the vertices are coloured in such a way that no two adjacent vertices receive the same colour, whereas in an improper vertex colouring, adjacent vertices are permitted to receive same colours subjected to some ...
Merlin Ellumkalayil, Sudev Naduvath
doaj   +1 more source

Resistance patterns and transmission of mono- and polyresistant TB: clinical impact of WGS. [PDF]

open access: yesJAC Antimicrob Resist, 2023
Dohál M   +12 more
europepmc   +1 more source

On improper interval edge colourings

open access: green, 2016
Peter Hudák   +3 more
openalex   +2 more sources

Home - About - Disclaimer - Privacy