Results 51 to 60 of about 2,800 (262)
Two conjectures on edge-colouring
Discrete Mathematics, 1989 A simple graph G is said to be Class 1 (resp. Class 2) if \(\chi'(G)=\Delta(G)\) (resp. \(\chi'(G)=\Delta(G)+1)\) where \(\chi'(G)\) is the chromatic index of G and \(\Delta(G)\) is the maximum degree of G. If G satisfies the inequality \(| E(G)| >\Delta (G)[| V(G)|],\) then G is said to be overfull. A. G.
openaire +1 more source
On edge-colouring indifference graphs
Theoretical Computer Science, 1995 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Celina M. H. de Figueiredo +2 more
openaire +1 more source
Enumerating the edge-colourings and total colourings of a regular graph [PDF]
Journal of Combinatorial Optimization, 2012 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Bessy, Stéphane, Havet, Frédéric
openaire +4 more sources
Asymptotically good edge correspondence colourings
Journal of Graph Theory, 2022 AbstractWe prove that every simple graph with maximum degree has edge correspondence number .
Michael Molloy 0001, Luke Postle
openaire +3 more sources
FEBS Letters, EarlyView.In this study, we found that human cervical‐derived adipocytes maintain intracellular iron level by regulating the expression of iron transport‐related proteins during adrenergic stimulation. Melanotransferrin is predicted to interact with transferrin receptor 1 based on in silico analysis.
Rahaf Alrifai +9 more
wiley +1 more source
On k-Distance Pell Numbers in 3-Edge-Coloured Graphs
Journal of Applied Mathematics, 2014 We define in this paper new distance generalizations of the Pell numbers and the companion Pell numbers. We give a graph interpretation of these numbers with respect to a special 3-edge colouring of the graph.
Krzysztof Piejko, Iwona Włoch
doaj +1 more source
Critical and Flow-Critical Snarks Coincide
Discussiones Mathematicae Graph Theory, 2021 Over the past twenty years, critical and bicritical snarks have been appearing in the literature in various forms and in different contexts. Two main variants of criticality of snarks have been studied: criticality with respect to the non-existence of a ...
Máčajová Edita, Škoviera Martin
doaj +1 more source
On homomorphisms to edge-coloured cycles
Electronic Notes in Discrete Mathematics, 2000 Abstract Given an edge-coloured graph H (a graph with the edges coloured, not necessarily by a proper colouring) the H -colouring problem asks whether or not an arbitrary edge-coloured graph G admits a homomorphism to H , i.e., a mapping of the vertices of G to the vertices of H which preserves edges and their colours. We study the complexity
Richard C. Brewster, Pavol Hell
openaire +1 more source
FEBS Letters, EarlyView.Structural and biochemical characterisations show that the planar cell polarity (PCP) protein Inturned harbours a unique PDZ‐like domain that does not bind canonical PDZ‐binding motifs (PBMs) like that of another PCP protein Vangl2. In contrast, the apical‐basal polarity protein Scribble contains four PDZ domains that bind Vangl2, but one PDZ domain ...
Stephan Wilmes +4 more
wiley +1 more source
On locally irregular decompositions of subcubic graphs [PDF]
Opuscula Mathematica, 2018 A graph \(G\) is locally irregular if every two adjacent vertices of \(G\) have different degrees. A locally irregular decomposition of \(G\) is a partition \(E_1,\dots,E_k\) of \(E(G)\) such that each \(G[E_i]\) is locally irregular.
Olivier Baudon +4 more
doaj +1 more source