Vertex arboricity and vertex degrees

DOI10.1007/S00373-016-1697-8zbMATH Open1351.05055OpenAlexW2341155139MaRDI QIDQ343708FDOQ343708

Authors: A. Nevo, E. Schmeichel, D. Bauer 

Publication date: 29 November 2016

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-016-1697-8

Recommendations

• On the vertex-arboricity of planar graphs
• Fractional Vertex Arboricity of Graphs
• Bounds on the arboricities of connected graphs
• Vertex and tree arboricities of graphs
• Bounds for the vertex linear arboricity

zbMATH Keywords

vertex arboricitybest monotone degree conditionsdegree sequences

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Vertex degrees (05C07)

Cites Work

• Title not available (Why is that?)
• On Hamilton's ideals
• An upper bound for the chromatic number of a graph and its application to timetabling problems
• Title not available (Why is that?)
• Title not available (Why is that?)
• A Note on the Vertex Arboricity of a Graph
• Best monotone degree conditions for graph properties: a survey

Cited In (5)

• A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs
• Fractional Vertex Arboricity of Graphs
• Vertex arboricity and maximum degree
• Best monotone degree conditions for graph properties: a survey
• Vertex arboricity of cographs

This page was built for publication: Vertex arboricity and vertex degrees

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