Zur algebraischen Begründung der Graphentheorie. I
From MaRDI portal
Publication:5617553
DOI10.1002/mana.19650280503zbMath0214.51003OpenAlexW2126701551MaRDI QIDQ5617553
Publication date: 1964
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19650280503
Related Items (26)
Acyclic subgraphs with high chromatic number ⋮ Trees contained in every orientation of a graph ⋮ Bispindles in strongly connected digraphs with large chromatic number ⋮ Oriented expressions of graph properties ⋮ Graph saturation games ⋮ Ramsey-nice families of graphs ⋮ A Ramsey type result for oriented trees ⋮ On properly ordered coloring of vertices in a vertex-weighted graph ⋮ Bispindle in strongly connected digraphs with large chromatic number ⋮ Monochromatic paths in random tournaments ⋮ Unnamed Item ⋮ Many Facets of Dualities ⋮ Interleaved adjoints of directed graphs ⋮ Colouring, constraint satisfaction, and complexity ⋮ Orientations of graphs with prescribed weighted out-degrees ⋮ A dualistic approach to bounding the chromatic number of a graph ⋮ Component Games on Regular Graphs ⋮ Partitioning edge-coloured complete symmetric digraphs into monochromatic complete subgraphs ⋮ Directed Ramsey number for trees ⋮ Structure and colour in triangle-free graphs ⋮ The trouble with the second quantifier ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles ⋮ On three blocks paths \(P (k, l, r)\) ⋮ Acyclic subgraphs of tournaments with high chromatic number ⋮ Tournaments and Semicomplete Digraphs ⋮ Subdivisions of oriented cycles in Hamiltonian digraphs with small chromatic number
This page was built for publication: Zur algebraischen Begründung der Graphentheorie. I
