Correction to: ``Note on forcing problem of trees

DOI10.1007/S00373-022-02457-3MaRDI QIDQ2667922zbMATH OpenOpenAlexFDO

Authors Mengya He, Shengjin Ji

Publication date 2 March 2022

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

Full work available at URL https://doi.org/10.1007/s00373-022-02457-3

Mathematics Subject Classification ID

Trees (05C05) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

Recommendations

• Corrigendum: ``Forcing a sparse minor
• Correction to: ``NoBLE for lattice trees and lattice animals
• Corrigendum to: ``Factoring, into edge transpositions of a tree, permutations fixing a terminal vertex
• Corrigendum to ``Maxima of the \(Q\)-index: forbidden odd cycles
• Corrigendum to: ``Bounds on the number of edges of edge-minimal, edge-maximal and \(l\)-hypertrees

Cited in

(3)

• Effective mixing and counting in trees – CORRIGENDUM
• Corrigendum: ``Forcing a sparse minor
• Correction to: ``NoBLE for lattice trees and lattice animals

This page was built for publication: Correction to: ``Note on forcing problem of trees

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