The Number of k-Coloured Graphs on Labelled Nodes
From MaRDI portal
Publication:3270980
DOI10.4153/CJM-1960-035-0zbMath0094.36202OpenAlexW2313793138MaRDI QIDQ3270980
Publication date: 1960
Published in: Canadian Journal of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.4153/cjm-1960-035-0
Related Items (10)
Enumeration of graphs with given weighted number of connected components ⋮ Random I‐colorable graphs ⋮ Counting acyclic and strong digraphs by descents ⋮ Generating functions of some families of directed uniform hypergraphs ⋮ Enumerating alternating matrix spaces over finite fields with explicit coordinates ⋮ Acyclic orientations of graphs. (Reprint) ⋮ On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics ⋮ The maximum number of colorings of graphs of given order and size: a survey ⋮ Acyclic orientations of graphs ⋮ Backtrack: An O(1) expected time algorithm for the graph coloring problem
This page was built for publication: The Number of k-Coloured Graphs on Labelled Nodes
