Interpolation theorems for the arboricity and the vertex arboricity of graphs

MaRDI QIDQ6565381zbMATH OpenFDO

Authors Teerasak Khoployklang, Araya Chaemchan

Publication date 2 July 2024

Published in Thai Journal of Mathematics (Search for Journal in Brave)

zbMATH Keywords

arboricitygraph parametervertex arboricityinterpolation theorem

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Bounds on the arboricities of connected graphs
• An intermediate value theorem for the arboricities
• scientific article; zbMATH DE number 1334616
• scientific article; zbMATH DE number 1135673
• Interpolation theorems on graph parameters

Cites work

• scientific article; zbMATH DE number 5239160 (Why is no real title available?)
• scientific article; zbMATH DE number 3222646 (Why is no real title available?)
• Degree sequences and chromatic numbers of graphs
• Edge-Disjoint Spanning Trees of Finite Graphs
• Graph theory with applications
• Interpolation theorem for diameters of spanning trees
• Interpolation theorem for the number of end‐vertices of spanning trees
• Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
• Interpolation theorems for a family of spanning subgraphs
• Interpolation theorems on graph parameters
• On maximum induced forests in graphs
• The Point-Arboricity of Planar Graphs
• The global set-domination number of a graph

This page was built for publication: Interpolation theorems for the arboricity and the vertex arboricity of graphs

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