scientific article; zbMATH DE number 3378931
From MaRDI portal
Publication:5650693
zbMATH Open0239.05105MaRDI QIDQ5650693FDOQ5650693
Authors: Horst Sachs 
Publication date: 1972
Title of this publication is not available (Why is that?)
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Relations of low-dimensional topology with graph theory (57M15) Graph theory (05Cxx)
Cited In (12)
- Upper bounds on the bondage number of a graph
- Acyclic colorings of planar graphs
- Light subgraphs of order at most 3 in large maps of minimum degree 5 on compact 2-manifolds
- Acyclic orientations and the chromatic polynomial
- A linear-time algorithm for finding an ambitus
- Bridges and Hamiltonian circuits in planar graphs
- An improved upper bound for the bondage number of graphs on surfaces
- On \(3\)-connected plane graphs without triangular faces
- Some counterexamples associated with the three-color problem
- A new proof of Grünbaum's 3 color theorem
- Upper bounds for the bondage number of graphs on topological surfaces
- Realizability of the torus and the projective plane in \(\mathbb{R}^ 4\)
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5650693)
