4‐chrome Graphen und vollständige 4‐Graphen

DOI10.1002/MANA.19600220106zbMATH Open0096.17902OpenAlexW2018942206MaRDI QIDQ3274686FDOQ3274686

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
• A generalization of Tutte's theorem on Hamiltonian cycles in planar 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
• Special subdivisions of \(K_4\) and 4-chromatic graphs
• On short paths through prescribed vertices of a graph
• On paths and cycles through specified vertices
• Local topological toughness and local factors
• On cycles through prescribed vertices in weakly separable graphs
• On constructive methods in the theory of colour-critical graphs
• Connectedness and structure in graphs
• On cycles through specified vertices
• On short cycles 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)