Forest embeddings in regular graphs of large girth

DOI10.1016/0095-8956(81)90090-3zbMath0394.05016OpenAlexW2050426110MaRDI QIDQ1252244

David G. Kirkpatrick, Derek Gordon Corneil

Publication date: 1981

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0095-8956(81)90090-3

zbMATH Keywords

EnumerationGirthC-Subgraph RegularC-Subgraph RegularityForest EmbeddingsGirth of a GraphGraph EmbeddingsGraph IsomorphismRecurrence FormulaRegular Graphs

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Enumeration in graph theory (05C30) Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25)

Related Items

Producing posets, On the complexity of regular resolution and the Davis-Putnam procedure

Cites Work

• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem
• Unnamed Item
• Unnamed Item