Graphic sequences of trees and a problem of Frobenius

DOI10.1007/S10587-007-0042-ZMaRDI QIDQ3617934zbMATH OpenOpenAlexFDO

Authors Gautam A. Gupta, Puneet Joshi, Amitabha Tripathi

Publication date 31 March 2009

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

Full work available at URL https://eudml.org/doc/31111, http://hdl.handle.net/10338.dmlcz/128153

zbMATH Keywords

tree-graphic

Mathematics Subject Classification ID

Trees (05C05) Vertex degrees (05C07)

Recommendations

• scientific article; zbMATH DE number 4112608
• Degree sequences in graphs
• Packing tree degree sequences
• Exact solution to an extremal problem on graphic sequences with a realization containing every 2-tree on \(k\) vertices
• Solution to a forcible version of a graphic sequence problem

Cites work

• Degree sets for graphs
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the order of a graph with a given degree set

Cited in

(18)

• Relaxed and approximate graph realizations
• On vertex-weighted realizations of acyclic and general graphs
• On potentially \((K_5-H)\)-graphic sequences.
• Potentially K m — G-graphical sequences: A survey
• scientific article; zbMATH DE number 4214024 (Why is no real title available?)
• scientific article; zbMATH DE number 4112608 (Why is no real title available?)
• Trees in graphs with conflict edges or forbidden transitions
• Composed degree-distance realizations of graphs
• Composed degree-distance realizations of graphs
• Graph realizations: maximum degree in vertex neighborhoods
• Approximate realizations for outerplanaric degree sequences
• Realizing graphs with cut constraints
• Degree realization by bipartite cactus graphs
• On bipartite graph realizations of a single degree sequence
• Approximate realizations for outerplanaric degree sequences
• On key parameters affecting the realizability of degree sequences (invited paper)
• Sparse graphic degree sequences have planar realizations
• Using linear forms to determine the set of integers realizable by \((g_ 0,g_ 1,\dots ,g_ n)\)-trees

This page was built for publication: Graphic sequences of trees and a problem of Frobenius

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