Paper Info
Title
Universal Graphs for Two Graph Properties.
Abstract
The graphs we consider are all countable. A graph U is universal in a given set P of graphs if every graph in P is an induced subgraph of U and U is an element of P. In this paper we show the existence of a universal graph in the set of all countable graphs with block order bounded by a fixed positive integer. We also investigate some classes of interval graphs and work towards finding universal graphs for them. The sets of graphs we consider are all examples of induced-hereditary graph properties.
Year
Venue
Field
2014
ARS COMBINATORIA
Discrete mathematics,Block graph,Combinatorics,Indifference graph,Line graph,Cograph,Graph product,Symmetric graph,Pathwidth,Universal graph,Mathematics
DocType
Volume
ISSN
Journal
116
0381-7032
Citations 
PageRank 
References 
0
0.34
0
Authors
2
Name
Order
Citations
PageRank
Izak Broere114331.30
Tomás Vetrík2128.13