Pages that link to "Item:Q3270980"
From MaRDI portal
The following pages link to The Number of <i>k</i>-Coloured Graphs on Labelled Nodes (Q3270980):
Displaying 10 items.
- Backtrack: An O(1) expected time algorithm for the graph coloring problem (Q794430) (← links)
- Enumerating alternating matrix spaces over finite fields with explicit coordinates (Q1981706) (← links)
- Counting acyclic and strong digraphs by descents (Q2198383) (← links)
- Generating functions of some families of directed uniform hypergraphs (Q2199871) (← links)
- The maximum number of colorings of graphs of given order and size: a survey (Q2317644) (← links)
- Acyclic orientations of graphs. (Reprint) (Q2497989) (← links)
- Acyclic orientations of graphs (Q2559389) (← links)
- Random I‐colorable graphs (Q4322472) (← links)
- Enumeration of graphs with given weighted number of connected components (Q4968685) (← links)
- On the problem of minimizing the cost with optical devices in Wavelength Division Multiplexing optical networks: complexity analysis, mathematical formulation and improved heuristics (Q5214308) (← links)