On a characterization of k-trees.

DOI10.1007/S10587-015-0180-7zbMATH Open1363.05036OpenAlexW2109503490MaRDI QIDQ2947993FDOQ2947993

Authors: De-Yan Zeng, Jian-Hua Yin 

Publication date: 29 September 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10338.dmlcz/144274

Recommendations

• scientific article
• A characterization of \(k\)-trees
• Independence number and \(k\)-trees of graphs
• A characterization of partial 3-trees
• scientific article; zbMATH DE number 4103086

zbMATH Keywords

characterization\(k\)-tree\(K_t\)-minor

Mathematics Subject Classification ID

Trees (05C05)

Cites Work

• A partial k-arboretum of graphs with bounded treewidth
• Title not available (Why is that?)
• On spanning 2-trees in a graph
• A Characterization of the degree sequences of 2-trees

Cited In (17)

• Title not available (Why is that?)
• Title not available (Why is that?)
• \(k\)-trees and some graph operators
• Subclasses of \(k\)-trees: characterization and recognition
• On trees with exactly one characteristic element
• Characterization of \(k\)-ctrees and graph valued functions
• Title not available (Why is that?)
• A characterization of \(k\)-trees
• On the zero forcing number of the complement of graphs with forbidden subgraphs
• Solution to a general version of a degree sequence variant of the Erdős-Sós conjecture
• \(k\)-paths of \(k\)-trees
• Title not available (Why is that?)
• Forbidden minors characterization of partial 3-trees
• Title not available (Why is that?)
• Title not available (Why is that?)
• Characterizations of \(H\)-graphs
• On extremal sizes of locally \(k\)-tree graphs.

This page was built for publication: On a characterization of \(k\)-trees.

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