scientific article; zbMATH DE number 3257166
From MaRDI portal
Publication:5545292
Cited in
(22)- Enumeration of coloured plane trees with a given type partition
- Characters of wreath products and some applications to representation theory and combinatorics
- On a problem in extremal graph theory
- Well-posedness of the iterative Boltzmann inversion
- The line analog of Ramsey numbers
- The point-arboricity of a graph
- Another analog of Ramsey numbers
- The Königsberg bridges problem generalized
- Enumeration of spanning trees containing given subgraphs
- Fixing subgraphs
- A graph polynomial and its applications
- Two applications of semi-stable graphs
- Enumeration of cyclic graphs and cyclic designs
- The Ramsey number N(3,3,3,3;2)
- Minimizing costs of sequential and parallel personnel testing programs
- Full reduction of a general square matrix
- Structural inference in organizations†
- MEASURING GEOMETRIC COMPLEXITY OF 3D MODELS FOR FEATURE RECOGNITION
- Enumeration of self‐converse digraphs
- On the number of balanced signed graphs
- scientific article; zbMATH DE number 3292655 (Why is no real title available?)
- Graph theory
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 Q5545292)
