The following pages link to (Q5331780):
Displaying 22 items.
- A supernodal formulation of vertex colouring with applications in course timetabling (Q610967) (← links)
- Metamathematical approach to proving theorems of discrete mathematics (Q1255328) (← links)
- A proof-scheme in discrete mathematics (Q1256323) (← links)
- Mixed graph colorings (Q1360876) (← links)
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- Monochromatic paths in random tournaments (Q1689907) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- The trouble with the second quantifier (Q2044549) (← links)
- Duality pairs and homomorphisms to oriented and unoriented cycles (Q2048544) (← links)
- Obstructions for acyclic local tournament orientation completions (Q2099464) (← links)
- Trees contained in every orientation of a graph (Q2138584) (← links)
- Oriented expressions of graph properties (Q2145766) (← links)
- Chromatic number and orientations of graphs and signed graphs (Q2316537) (← links)
- A note on orientation and chromatic number of graphs (Q2410109) (← links)
- The application of the methods of the theory of logical derivation to graph theory (Q2558225) (← links)
- On properly ordered coloring of vertices in a vertex-weighted graph (Q2665834) (← links)
- Many Facets of Dualities (Q2971613) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Lexicographic Orientation Algorithms (Q3120444) (← links)
- Monochromatic trees in random tournaments (Q4993096) (← links)
- (Q5000292) (← links)
- Path homomorphisms, graph colorings, and boolean matrices (Q5190330) (← links)
