Forest embeddings in regular graphs of large girth

DOI10.1016/0095-8956(81)90090-3MaRDI QIDQ1252244zbMATH OpenOpenAlexFDO

Authors David Kirkpatrick, Derek G. 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) Planar graphs; geometric and topological aspects of graph theory (05C10) Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Enumeration in graph theory (05C30) Paths and cycles (05C38)

Cites work

• scientific article; zbMATH DE number 3230027 (Why is no real title available?)
• scientific article; zbMATH DE number 3189017 (Why is no real title available?)
• A Theoretical Analysis of Various Heuristics for the Graph Isomorphism Problem

Cited in

(2)

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

This page was built for publication: Forest embeddings in regular graphs of large girth

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1252244)