On induced-universal graphs for the class of bounded-degree graphs

DOI10.1016/j.ipl.2008.04.020zbMath1189.05162OpenAlexW2054926432MaRDI QIDQ975466

Arnaud Labourel, Pascal Ochem, Louis Esperet

Publication date: 9 June 2010

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2008.04.020

zbMATH Keywords

combinatorial problemshomomorphismbounded degreeuniversal graphedge partition

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Induced-universal graphs for graphs with bounded maximum degree, Adjacency Labeling Schemes and Induced-Universal Graphs, Supertrees, Near-optimal induced universal graphs for cycles and paths, Optimal induced universal graphs for bounded-degree graphs, Induced Universal Hypergraphs, Asymptotically optimal induced universal graphs, Shorter Labeling Schemes for Planar Graphs, UNIVERSAL GRAPHS AND UNIVERSAL PERMUTATIONS

Cites Work

• Unnamed Item
• Induced-universal graphs for graphs with bounded maximum degree
• On universal graphs for planar oriented graphs of a given girth
• 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
• The chromatic number of oriented graphs
• On Universal Graphs for Spanning Trees
• On minimal n-universal graphs
• Sparse universal graphs for bounded‐degree graphs
• Coding the vertexes of a graph