4‐chrome Graphen und vollständige 4‐Graphen
From MaRDI portal
Publication:3274686
DOI10.1002/mana.19600220106zbMath0096.17902OpenAlexW2018942206MaRDI QIDQ3274686
Publication date: 1960
Published in: Mathematische Nachrichten (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/mana.19600220106
Related Items (13)
On short cycles through prescribed vertices of a graph ⋮ On paths and cycles through specified vertices ⋮ Circuits through prescribed vertices in k‐connected k‐regular graphs ⋮ Local topological toughness and local factors ⋮ On short paths through prescribed vertices of a graph ⋮ On constructive methods in the theory of colour-critical graphs ⋮ Special subdivisions of \(K_4\) and 4-chromatic graphs ⋮ On the complexity of \(k\)-rainbow cycle colouring problems ⋮ When m vertices in a k-connected graph cannot be walked round along a simple cycle ⋮ On cycles through specified vertices ⋮ On cycles through prescribed vertices in weakly separable graphs ⋮ Connectedness and structure in graphs ⋮ A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
This page was built for publication: 4‐chrome Graphen und vollständige 4‐Graphen
