Interpolation theorems on graph parameters
From MaRDI portal
Recommendations
Cited in
(16)- Interpolation theorems for the arboricity and the vertex arboricity of graphs
- scientific article; zbMATH DE number 2158066 (Why is no real title available?)
- Interpolation properties of domination parameters of a graph
- Graphs isomorphisms under edge-replacements and the family of amoebas
- Interpolation theorem for a continuous function on orientations of a simple graph
- scientific article; zbMATH DE number 6274852 (Why is no real title available?)
- Unavoidable chromatic patterns in 2‐colorings of the complete graph
- scientific article; zbMATH DE number 2199830 (Why is no real title available?)
- Switchings, realizations, and interpolation theorems for graph parameters
- scientific article; zbMATH DE number 4103087 (Why is no real title available?)
- scientific article; zbMATH DE number 2015546 (Why is no real title available?)
- scientific article; zbMATH DE number 4114652 (Why is no real title available?)
- scientific article; zbMATH DE number 1390493 (Why is no real title available?)
- scientific article; zbMATH DE number 5239160 (Why is no real title available?)
- Interpolation theorems for graphs, hypergraphs and matroids
- Interpolation theorems for domination numbers of a graph
This page was built for publication: Interpolation theorems on graph parameters
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1768047)