• Title of article

    On vertex-degree restricted subgraphs in polyhedral graphs Original Research Article

  • Author/Authors

    Igor Fabrici، نويسنده ,

  • Issue Information
    روزنامه با شماره پیاپی سال 2002
  • Pages
    10
  • From page
    105
  • To page
    114
  • Abstract
    First a brief survey of known facts is given. Main result of this paper: every polyhedral (i.e. 3-connected planar) graph G with minimum degree at least 4 and order at least k (k⩾4) contains a connected subgraph on k vertices having degrees (in G) at most 4k−1, the bound 4k−1 being best possible.
  • Keywords
    3-Connected planar graph , Light graph , Subgraph with restricted degrees , Path
  • Journal title
    Discrete Mathematics
  • Serial Year
    2002
  • Journal title
    Discrete Mathematics
  • Record number

    950212

    • Link To Document
    https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=950212