Results 41 to 50 of about 2,800 (259)
On distance edge-colourings and matchings
Electronic Notes in Discrete Mathematics, 2009 Abstract We consider a distance generalisation of the strong chromatic index and the maximum induced matching number, for graphs of bounded maximum degree and Erdős-Renyi random graphs.
Ross J. Kang, Putra Manggala
openaire +1 more source
Bilangan Kromatik Grap Commuting dan Non Commuting Grup Dihedral
Cauchy: Jurnal Matematika Murni dan Aplikasi, 2015 Commuting graph is a graph that has a set of points X and two different vertices to be connected directly if each commutative in G. Let G non abelian group and Z(G) is a center of G.
Handrini Rahayuningtyas +2 more
doaj +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
A note on face coloring entire weightings of plane graphs
Discussiones Mathematicae Graph Theory, 2014 Given a weighting of all elements of a 2-connected plane graph G = (V,E, F), let f(α) denote the sum of the weights of the edges and vertices incident with the face _ and also the weight of _.
Jendrol Stanislav, Šugerek Peter
doaj +1 more source
Mixed graph colouring as scheduling multi-processor tasks with equal processing times
Журнал Белорусского государственного университета: Математика, информатика, 2021 A problem of scheduling partially ordered unit-time tasks processed on dedicated machines is formulated as a mixed graph colouring problem, i. e., as an assignment of integers (colours) {1, 2, …, t} to the vertices (tasks) V {ν1, ν2, …, νn}, of the mixed
Yuri N. Sotskov
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
Total Graph Interpretation of the Numbers of the Fibonacci Type
Journal of Applied Mathematics, 2015 We give a total graph interpretation of the numbers of the Fibonacci type. This graph interpretation relates to an edge colouring by monochromatic paths in graphs. We will show that it works for almost all numbers of the Fibonacci type. Moreover, we give
Urszula Bednarz +2 more
doaj +1 more source
Pediatric Blood &Cancer, EarlyView.ABSTRACT Background Although significant progress has been made in childhood leukemia survival, healthcare providers, and caregivers often face challenges in explaining this disease to patients. Disease‐targeted storybooks have been proposed as a tool to facilitate the understanding of diagnoses and treatment.
Nutvipha Ummartyotin +6 more
wiley +1 more source
Edge Colouring of Neutrosophic Graphs and Its Application in Detection of Phishing Website
Discrete Dynamics in Nature and Society, 2022 Graph colouring enjoys many practical as well as theoretical uses. Graph colouring is still a very active subject of research. This article introduces a new concept of the chromatic number of the neutrosophic graph (NG).
Rupkumar Mahapatra +2 more
doaj +1 more source
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