Entry Farr:1985:CCH from tcs1985.bib

Last update: Thu Sep 27 02:46:57 MDT 2018                Valid HTML 4.0!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Farr:1985:CCH,
  author =       "G. Farr and C. McDiarmid",
  title =        "The complexity of counting homeomorphs",
  journal =      j-THEOR-COMP-SCI,
  volume =       "36",
  number =       "2--3",
  pages =        "345--348",
  month =        apr,
  year =         "1985",
  CODEN =        "TCSCDI",
  ISSN =         "0304-3975 (print), 1879-2294 (electronic)",
  ISSN-L =       "0304-3975",
  bibdate =      "Sat Nov 22 13:29:49 MST 1997",
  bibsource =    "http://www.math.utah.edu/pub/tex/bib/tcs1985.bib",
  acknowledgement = ack-nhfb,
  classification = "C1160 (Combinatorial mathematics); C4240
                 (Programming and algorithm theory)",
  corpsource =   "Math. Inst., Oxford, UK",
  fjournal =     "Theoretical Computer Science",
  journal-URL =  "http://www.sciencedirect.com/science/journal/03043975/",
  keywords =     "complexity; computational complexity; counting
                 homeomorphs; finite nontrivial family of graphs; graph
                 theory; minimal nonplanar subgraphs; subgraphs",
  pubcountry =   "Netherlands A14",
  treatment =    "T Theoretical or Mathematical",
}

Related entries