On Universal Graphs of Minor Closed Families
From MaRDI portal
Publication:5300987
DOI10.1016/j.endm.2008.06.017zbMath1267.05218OpenAlexW2036186549MaRDI QIDQ5300987
Publication date: 28 June 2013
Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.endm.2008.06.017
Structural characterization of families of graphs (05C75) Graph minors (05C83) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Excluding any graph as a minor allows a low tree-width 2-coloring
- An unexpected result in coding the vertices of a graph
- Universal graphs and induced-universal graphs
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- Implicat Representation of Graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- On Universal Graphs for Spanning Trees
- On minimal n-universal graphs
- Sparse universal graphs for bounded‐degree graphs
- Coding the vertexes of a graph
This page was built for publication: On Universal Graphs of Minor Closed Families