The Number of k-Coloured Graphs on Labelled Nodes
From MaRDI portal
Publication:3270980
DOI10.4153/CJM-1960-035-0zbMATH Open0094.36202OpenAlexW2313793138MaRDI QIDQ3270980FDOQ3270980
Authors: Ronald C. Read 
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
Cited In (10)
- The maximum number of colorings of graphs of given order and size: a survey
- Backtrack: An O(1) expected time algorithm for the graph coloring problem
- Random I‐colorable graphs
- Enumeration of graphs with given weighted number of connected components
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics
- Generating functions of some families of directed uniform hypergraphs
- Acyclic orientations of graphs. (Reprint)
- Acyclic orientations of graphs
- Counting acyclic and strong digraphs by descents
- Enumerating alternating matrix spaces over finite fields with explicit coordinates
This page was built for publication: The Number of k-Coloured Graphs on Labelled Nodes
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3270980)
