Induced-universal graphs for graphs with bounded maximum degree

DOI10.1007/s00373-009-0860-xzbMath1179.05056MaRDI QIDQ844226

Steve Butler

Publication date: 18 January 2010

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

Full work available at URL: https://doi.org/10.1007/s00373-009-0860-x

zbMATH Keywords

universal graphs; graph decomposition; induced universal graphs

Mathematics Subject Classification ID

05C35: Extremal problems in graph theory

Related Items

On induced-universal graphs for the class of bounded-degree graphs, Extremal results in sparse pseudorandom graphs, UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On induced-universal graphs for the class of bounded-degree graphs
• Expanding graphs contain all small trees
• Graphs with certain families of spanning trees
• Universal caterpillars
• Sparse universal graphs
• Small universal graphs for bounded-degree planar graphs
• Pancyclic graphs. I
• Small universal graphs
• Universal graphs and induced-universal graphs
• Universal Graphs for Bounded-Degree Trees and Planar Graphs
• On Graphs Which Contain All Sparse Graphs
• Implicat Representation of Graphs
• On Universal Graphs for Spanning Trees
• On minimal n-universal graphs
• Sparse universal graphs for bounded‐degree graphs