On universal graphs of minor closed families
From MaRDI portal
Publication:5300987
DOI10.1016/J.ENDM.2008.06.017zbMATH Open1267.05218OpenAlexW2036186549MaRDI QIDQ5300987FDOQ5300987
Authors: Arnaud Labourel
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
Recommendations
Graph representations (geometric and intersection representations, etc.) (05C62) Structural characterization of families of graphs (05C75) Graph minors (05C83)
Cites Work
- Implicat Representation of Graphs
- Universal graphs and induced-universal graphs
- Universal Graphs for Bounded-Degree Trees and Planar Graphs
- On Universal Graphs for Spanning Trees
- Sparse universal graphs for bounded‐degree graphs
- Approximating Treewidth, Pathwidth, Frontsize, and Shortest Elimination Tree
- An unexpected result in coding the vertices of a graph
- On minimal n-universal graphs
- Excluding any graph as a minor allows a low tree-width 2-coloring
- Coding the vertexes of a graph
Cited In (3)
This page was built for publication: On universal graphs of minor closed families
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5300987)