1 research outputs found

    Triangle-free planar graphs with minimum degree 3 have radius at least 3

    No full text
    We prove that every triangle-free planar graph with minimum degree 3 has radius at least 3; equivalently, no vertex neighborhood is a dominating set
    corecore