Results 141 to 148 of about 6,056 (148)

Uncertainty‐Aware Visualization of Biomolecular Structures

open access: yes
Computer Graphics Forum, EarlyView.
A. Sterzik   +3 more
wiley   +1 more source

A note on improper DP-colouring of planar graphs

International Journal of Computer Mathematics: Computer Systems Theory, 2021
DP-colouring (also known as correspondence colouring), introduced by Dvořak and Postle, is a generalization of list colouring.
Hongyan Cai, Qiang Sun
openaire   +1 more source

Improper sum-list colouring of 2-trees

Discrete Applied Mathematics, 2019
Abstract Let G be a graph and P be a class of graphs. We consider list colouring of vertices of G in which the sizes of lists assigned to different vertices can be different. We colour G from the lists in such a way that vertices of each colour class induce a graph in P .
Agata Drzystek, Ewa Drgas-Burchardt
openaire   +2 more sources

Acyclic improper colouring of graphs with maximum degree 4

Science China Mathematics, 2014
A k-colouring (not necessarily proper) of vertices of a graph is called acyclic, if for every pair of distinct colours i and j the subgraph induced by the edges whose endpoints have colours i and j is acyclic. We consider acyclic k-colourings such that each colour class induces a graph with a given (hereditary) property.
Elżbieta Sidorowicz, Anna Fiedorowicz
openaire   +2 more sources

Detection of improper sealing and quality deterioration of modified-atmosphere-packed pizza by a colour indicator

Food Control, 1997
The effects of leaking on the quality of modified-atmosphere-packed chilled minced meat pizza were studied. Capillary-like leaks of various sizes were made experimentally in the sealing area with tungsten threads of diameters 50 and 100 μm. Test packages were stored for 5 weeks at 5 °C (in darkness or under illumination) or at 10 °C in darkness and the
Eero Hurme, Raija Ahvenainen, M. Eilamo
openaire   +5 more sources

List Improper Colourings of Planar Graphs

Combinatorics, Probability and Computing, 1999
A graph G is m-choosable with impropriety d, or simply (m, d)*-choosable, if for every list assignment L, where [mid ]L(v)[mid ][ges ]m for every v∈V(G), there exists an L-colouring of G such that each vertex of G has at most d neighbours coloured with the same colour as itself. We show that every planar graph is (3, 2)*-choosable and
openaire   +2 more sources

Extremal Graph Theory for Minors, Improper Colourings and Gonality

2019
A graph, consists of a collection of vertices, some of which are joined by edges. Graphs are extremely useful for modelling and solving a wide range of real world problems, from traffic congestion to scheduling problems. We answer several questions about abstract graphs. We show that if a graph has five times as many edges as vertices, then it contains
openaire   +2 more sources

Acyclic improper colourings of graphs with bounded degree

1999
Pierre Boiron   +2 more
openaire   +1 more source

Home - About - Disclaimer - Privacy