Switchings, realizations, and interpolation theorems for graph parameters

DOI10.1155/IJMMS.2005.2095MaRDI QIDQ2576009zbMATH OpenFDO

Authors N. Punnim

Publication date 7 December 2005

Published in International Journal of Mathematics and Mathematical Sciences (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/51817

zbMATH Keywords

problem

Mathematics Subject Classification ID

Vertex degrees (05C07)

Review text

Summary: Interpolation theorems on several graph parameters obtained in the past few years will be reviewed in this paper. Some simplified proofs are provided. Open problems in this direction are reviewed.

Recommendations

• scientific article; zbMATH DE number 2199830
• scientific article; zbMATH DE number 2015546
• scientific article; zbMATH DE number 2158066
• Interpolation theorems on graph parameters
• scientific article; zbMATH DE number 2156795

Cited in

(9)

• Integral graphs obtained by dual Seidel switching
• On a connection between the switching separability of a graph and that of its subgraphs
• scientific article; zbMATH DE number 2158066 (Why is no real title available?)
• The Forest Number of (n,m)-Graphs
• scientific article; zbMATH DE number 2199830 (Why is no real title available?)
• scientific article; zbMATH DE number 5239160 (Why is no real title available?)
• Switchings, extensions, and reductions in central digraphs
• Graphs isomorphisms under edge-replacements and the family of amoebas
• An intermediate value theorem for the decycling numbers of Toeplitz graphs

This page was built for publication: Switchings, realizations, and interpolation theorems for graph parameters

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2576009)