Results 291 to 300 of about 901,024 (319)
Some of the next articles are maybe not open access.
Fuzzy colouring of m-polar fuzzy graph and its application
Journal of Intelligent & Fuzzy Systems, 2018In this article, a new idea of fuzzy coloring of m-polar fuzzy graph is presented while establishing the relationship between chromatic number of m-polar fuzzy graph and it’s underlying crisp graph. Some properties of m-polar fuzzy graph and new concepts
Tanmoy Mahapatra, M. Pal
semanticscholar +1 more source
Okhuma Graphs and Coloured Chains
Order, 2004zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Giraudet, M., Truss, J. K.
openaire +1 more source
Annals of Operations Research, 1984
We discuss some results concerned with the behaviour of colouring algorithms on large random graphs.
openaire +1 more source
We discuss some results concerned with the behaviour of colouring algorithms on large random graphs.
openaire +1 more source
2006
The four-colour problem asks whether every planar graph is 4-colourable. The proof of the four-colour theorem by Appel, Haken, and Koch [1, 3] relies on the existence in a planar graph of a set of unavoidable configurations which must be shown to be reducible.
openaire +1 more source
The four-colour problem asks whether every planar graph is 4-colourable. The proof of the four-colour theorem by Appel, Haken, and Koch [1, 3] relies on the existence in a planar graph of a set of unavoidable configurations which must be shown to be reducible.
openaire +1 more source
Canadian Mathematical Bulletin, 1972
By anr-graph G we mean a finite setV(G) of elements called vertices and a setE(G) of some of ther-subsets ofV(G) called edges. This paper defines certain colour classes ofr-graphs which connect the material of a variety of recent graph theoretic literature in that many existing results may be reformulated as structural properties of the classes for ...
openaire +2 more sources
By anr-graph G we mean a finite setV(G) of elements called vertices and a setE(G) of some of ther-subsets ofV(G) called edges. This paper defines certain colour classes ofr-graphs which connect the material of a variety of recent graph theoretic literature in that many existing results may be reformulated as structural properties of the classes for ...
openaire +2 more sources
Canadian Journal of Mathematics, 1963
Let Fn(k) denote the total number of k-coloured graphs on n labelled nodes and let Mn(k) denote the number of graphs on n nodes that are coloured in at most kcolours ; also let fn(k) denote the number of connected k coloured graphs on n nodes. Read (3) has proved the following formulas:
openaire +1 more source
Let Fn(k) denote the total number of k-coloured graphs on n labelled nodes and let Mn(k) denote the number of graphs on n nodes that are coloured in at most kcolours ; also let fn(k) denote the number of connected k coloured graphs on n nodes. Read (3) has proved the following formulas:
openaire +1 more source
Graph Colouring: from Structure to Algorithms (Dagstuhl Seminar 19271)
Dagstuhl Reports, 2019M. Chudnovsky +2 more
semanticscholar +1 more source
Alternative representations of P systems solutions to the graph colouring problem
Journal of Membrane Computing, 2019J. Cooper, Radu Nicolescu
semanticscholar +1 more source