Universal bridge-free graphs
From MaRDI portal
Publication:6502057
arXivmath/9409206MaRDI QIDQ6502057
Author name not available (Why is that?)
Abstract: We prove that there is no countable universal -free graph for all and that there is no countable universal graph in the class of graphs omitting all cycles of length at most for .
This page was built for publication: Universal bridge-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6502057)