scientific article; zbMATH DE number 3020563
From MaRDI portal
Publication:5762903
zbMath0013.22803MaRDI QIDQ5762903
Publication date: 1936
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Introductory exposition (textbooks, tutorial papers, etc.) pertaining to manifolds and cell complexes (57-01) Graph theory (05Cxx)
Related Items (45)
n-connectedness in pure 2-complexes ⋮ Intersection graphs of paths in a tree ⋮ Tree densities in sparse graph classes ⋮ The feasible matching problem ⋮ Negative (and positive) circles in signed graphs: a problem collection ⋮ Game, set, and graph ⋮ The geometry and combinatorics of discrete line segment hypergraphs ⋮ On a class of infinitary codes ⋮ On Kernels of Graphs and Solutions of Games: A Synopsis Based on Relations and Fixpoints ⋮ A family of non-periodic tilings of the plane by right golden triangles ⋮ F-factors of graphs: A generalized matching problem ⋮ Brouwer's fan theorem as an axiom and as a contrast to Kleene's alternative ⋮ A note on covering edge colored hypergraphs by monochromatic components ⋮ Six signed Petersen graphs, and their automorphisms ⋮ Odd Decompositions of Eulerian Graphs ⋮ Jacobi's bound: Jacobi's results translated in Kőnig's, Egerváry's and Ritt's mathematical languages ⋮ REGULAR EXTENSION OF GRAPHS ⋮ Automated verification of shape, size and bag properties via user-defined predicates in separation logic ⋮ ``Réseaux réguliers or regular graphs -- Georges Brunel as a French pioneer in graph theory. ⋮ Closed schedulers: a novel technique for analyzing asynchronous protocols ⋮ How to stay in a set or Koenig's lemma for random paths ⋮ Paley and the Paley Graphs ⋮ On flat flag-transitive \(c.c^*\)-geometries ⋮ The finite projective plane and the 5-uniform linear intersecting hypergraphs with domination number four ⋮ The Erdős-Menger conjecture for source/sink sets with disjoint closures ⋮ Antiparallel \(d\)-stable traces and a stronger version of ore problem ⋮ Inside-out polytopes ⋮ Unnamed Item ⋮ On two-sided infinite fixed points of morphisms ⋮ Monochromatic components in edge-colored complete uniform hypergraphs ⋮ Three-dimensional right-angled polytopes of finite volume in the Lobachevsky space: combinatorics and constructions ⋮ Unnamed Item ⋮ On compact symmetric regularizations of graphs ⋮ Vertex-minimal graphs with nonabelian \(\mathbf{2}\)-group symmetry ⋮ Domination in Chessboards ⋮ Domination in Digraphs ⋮ Minimal hard surface-unlink and classical unlink diagrams ⋮ Inducing regulation of any digraphs ⋮ Two-factorizations of small complete graphs ⋮ The symmetrization of matrices by diagonal matrices ⋮ Manhattan orbifolds ⋮ Realisability problem in arrow categories ⋮ Weak (projective) radius and finite equational bases for classes of lattices ⋮ The structure of graphs with forbidden induced $C_4$, $\overline{C}_4$, $C_5$, $S_3$, chair and co-chair ⋮ A note on total domination
This page was built for publication:
