Note on ``hook-length as a graph invariant of trees

DOI10.4310/JOC.2017.V8.N1.A8zbMATH Open1352.05052OpenAlexW2559403749MaRDI QIDQ501992FDOQ501992

Hua Wang

Publication date: 10 January 2017

Published in: Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.4310/joc.2017.v8.n1.a8

zbMATH Keywords

Ferrers diagrams of integer partitions

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35) Distance in graphs (05C12)

Cited In (1)

• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees

Uses Software

• HookExp

   Recommendations

• On some degree-and-distance-based graph invariants of trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Two tree-width-like graph invariants 👍 👎
• Two kinds of hook length formulas for complete \(m\)-ary trees 👍 👎
• Title not available (Why is that?) 👍 👎
• Yet Another Generalization of Postnikov's Hook Length Formula for Binary Trees 👍 👎
• A note on the arboricity of graphs 👍 👎
• On Postnikov's hook length formula for binary trees 👍 👎
• Extremal properties of distance-based graph invariants for $k$-trees 👍 👎
• A unifying approach for proving hook-length formulas for weighted tree families 👍 👎

This page was built for publication: Note on ``hook-length as a graph invariant of trees

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