Pages that link to "Item:Q5617553"
From MaRDI portal
The following pages link to Zur algebraischen Begründung der Graphentheorie. I (Q5617553):
Displayed 26 items.
- Graph saturation games (Q324842) (← links)
- A Ramsey type result for oriented trees (Q338566) (← links)
- Colouring, constraint satisfaction, and complexity (Q458466) (← links)
- Orientations of graphs with prescribed weighted out-degrees (Q489364) (← links)
- Interleaved adjoints of directed graphs (Q648963) (← links)
- Acyclic subgraphs with high chromatic number (Q1621059) (← links)
- Bispindles in strongly connected digraphs with large chromatic number (Q1640212) (← links)
- Ramsey-nice families of graphs (Q1645058) (← links)
- Monochromatic paths in random tournaments (Q1689907) (← links)
- Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs (Q1783629) (← 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)
- On three blocks paths \(P (k, l, r)\) (Q2081489) (← links)
- Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number (Q2092433) (← links)
- Trees contained in every orientation of a graph (Q2138584) (← links)
- Oriented expressions of graph properties (Q2145766) (← links)
- Bispindle in strongly connected digraphs with large chromatic number (Q2413152) (← links)
- A dualistic approach to bounding the chromatic number of a graph (Q2462336) (← 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)
- Acyclic subgraphs of tournaments with high chromatic number (Q4999677) (← links)
- (Q5000292) (← links)
- Component Games on Regular Graphs (Q5414147) (← links)
- Directed Ramsey number for trees (Q5915808) (← links)