scientific article
From MaRDI portal
Publication:3312256
zbMath0531.05031MaRDI QIDQ3312256
Publication date: 1983
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Introductory exposition (textbooks, tutorial papers, etc.) pertaining to combinatorics (05-01) Graph theory (05Cxx)
Related Items (31)
New sufficient conditions on the degree sequences of uniform hypergraphs ⋮ Some remarks on the Kronecker product of graphs ⋮ Slender graphs ⋮ Coloration de graphes : fondements et applications ⋮ Restricted coloring models for timetabling ⋮ A new property of critical imperfect graphs and some consequences ⋮ On the Hopf algebra of functional graphs and differential algebras ⋮ Calculating the Euler characteristic of the moduli space of curves ⋮ Analysis of a randomized rendezvous algorithm ⋮ A Short Proof of Ore’s f-Factor Theorem Using Flows ⋮ On the complexity of graph tree partition problems. ⋮ Almost nonpreemptive schedules ⋮ On the use of augmenting chains in chain packings ⋮ Reduction of indefinite quadratic programs to bilinear programs ⋮ On the strong and the semi-strong path partition conjecture ⋮ On the use of graphs in discrete tomography ⋮ First order properties on nowhere dense structures ⋮ Reconstruction of domino tiling from its two orthogonal projections ⋮ Chvátal-Erdős conditions for paths and cycles in graphs and digraphs. A survey ⋮ Primitive zonotopes ⋮ The compared costs of domination location-domination and identification ⋮ Node rewriting in graphs and hypergraphs: A categorical framework ⋮ Minimum identifying codes in some graphs differing by matchings ⋮ The choice probabilities of the latent-scale model satisfy the size-independent model when \(n\) is small. ⋮ Cabri-graph, a sketchpad for graph theory. ⋮ On the logic of unification ⋮ On the Degree Sequence of 3-Uniform Hypergraph: A New Sufficient Condition ⋮ Random-cluster representation of the Ashkin-Teller model ⋮ Colorations généralisées, graphes biorientés et deux ou trois choses sur François. (Generalized colourings, digraphs and some things concerning François) ⋮ Variations sur le thème \({E+\overline {E} = XY}\) (Variations on the theme \({E+\overline {E} = XY})\) ⋮ The Kronecker product and local computations in graphs
This page was built for publication:
