Cited in
(13)- A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
- On constructive methods in the theory of colour-critical graphs
- Special subdivisions of \(K_4\) and 4-chromatic graphs
- When m vertices in a k-connected graph cannot be walked round along a simple cycle
- On short cycles through prescribed vertices of a graph
- On paths and cycles through specified vertices
- Local topological toughness and local factors
- On the complexity of \(k\)-rainbow cycle colouring problems
- On cycles through specified vertices
- Circuits through prescribed vertices in k‐connected k‐regular graphs
- On cycles through prescribed vertices in weakly separable graphs
- Connectedness and structure in graphs
- On short paths through prescribed vertices of a graph
This page was built for publication: 4‐chrome Graphen und vollständige 4‐Graphen
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3274686)
