Characterizing path graphs by forbidden induced subgraphs
Copyright policy )Characterizing path graphs by forbidden induced subgraphs
AbstractA path graph is the intersection graph of subpaths of a tree. In 1970, Renz asked for a characterization of path graphs by forbidden induced subgraphs. We answer this question by determining the complete list of graphs that are not path graphs and are minimal with this property. © 2009 Wiley Periodicals, Inc. J Graph Theory 62: 369–384, 2009
FOS: Computer and information sciences, Extremal problems in graph theory, Discrete Mathematics (cs.DM), path graphs, forbidden induced subgraphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Paths and cycles, intersection graphs, 004, Computer Science - Discrete Mathematics
FOS: Computer and information sciences, Extremal problems in graph theory, Discrete Mathematics (cs.DM), path graphs, forbidden induced subgraphs, [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM], Paths and cycles, intersection graphs, 004, Computer Science - Discrete Mathematics
selected citations These citations are derived from selected sources.This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).12 popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.Average influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).Top 10% impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.Top 10%
Citations provided by BIP!Popularity provided by BIP!