Vertex arboricity and vertex degrees

DOI10.1007/S00373-016-1697-8zbMath1351.05055OpenAlexW2341155139MaRDI QIDQ343708

A. Nevo, Edward F. Schmeichel, Douglas 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

zbMATH Keywords

vertex arboricitybest monotone degree conditionsdegree sequences

Mathematics Subject Classification ID

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

Related Items (2)

A Catlin-type theorem for graph partitioning avoiding prescribed subgraphs ⋮ Best monotone degree conditions for graph properties: a survey

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Best monotone degree conditions for graph properties: a survey
• On Hamilton's ideals
• A Note on the Vertex Arboricity of a Graph
• An upper bound for the chromatic number of a graph and its application to timetabling problems

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