4‐chrome Graphen und vollständige 4‐Graphen

DOI10.1002/MANA.19600220106MaRDI QIDQ3274686zbMATH OpenOpenAlexFDO

Authors G. A. Dirac

Publication date 1960

Published in Mathematische Nachrichten (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/mana.19600220106

zbMATH Keywords

topology

Cited in

(13)

• Circuits through prescribed vertices in k‐connected k‐regular graphs
• On paths and cycles through specified vertices
• A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs
• Connectedness and structure in graphs
• On cycles through prescribed vertices in weakly separable graphs
• On cycles through specified vertices
• On the complexity of \(k\)-rainbow cycle colouring problems
• On short cycles through prescribed vertices of a graph
• On constructive methods in the theory of colour-critical graphs
• On short paths through prescribed vertices of a graph
• Special subdivisions of \(K_4\) and 4-chromatic graphs
• Local topological toughness and local factors
• When m vertices in a k-connected graph cannot be walked round along a simple cycle

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)