Graph classes characterized both by forbidden subgraphs and degree sequences

DOI10.1002/jgt.20270zbMath1139.05054OpenAlexW4251361050MaRDI QIDQ5441407

Michael D. Barrus, Stephen G. Hartke, Mohit Kumbhat

Publication date: 13 February 2008

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20270

zbMATH Keywords

forbidden graph2-switch operation, degree-sequence-forcing-setdegree sequence characterisation

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Vertex degrees (05C07)

Related Items (10)

The study of the b-choromatic number of some classes of fractal graphs ⋮ Unnamed Item ⋮ Forbidden subgraphs and the existence of a spanning tree without small degree stems ⋮ New results on degree sequences of uniform hypergraphs ⋮ Forcibly bipartite and acyclic (uni-)graphic sequences ⋮ On 2-switches and isomorphism classes ⋮ Forbidden Subgraphs Generating Almost the Same Sets ⋮ Non-minimal degree-sequence-forcing triples ⋮ The feasibility problem for line graphs ⋮ Minimal forbidden sets for degree sequence characterizations

Cites Work

• A Note on Unigraphic Sequences
• Forbidden triples implying Hamiltonicity: for all graphs
• Some Properties of Graphs with Multiple Edges

This page was built for publication: Graph classes characterized both by forbidden subgraphs and degree sequences