Interpolation theorems for the arboricity and the vertex arboricity of graphs

MaRDI QIDQ6565381FDOQ6565381

Authors: Teerasak Khoployklang, Araya Chaemchan 

Publication date: 2 July 2024

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

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

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)

Cites Work

• Graph theory with applications
• Edge-Disjoint Spanning Trees of Finite Graphs
• The Point-Arboricity of Planar Graphs
• On maximum induced forests in graphs
• Degree sequences and chromatic numbers of graphs
• Interpolation theorem for diameters of spanning trees
• Title not available (Why is that?)
• Interpolation theorem for the number of pendant vertices of connected spanning subgraphs of equal size
• Interpolation theorem for the number of end‐vertices of spanning trees
• Interpolation theorems on graph parameters
• Interpolation theorems for a family of spanning subgraphs
• Title not available (Why is that?)
• 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)