Graphs omitting a finite set of cycles

DOI10.1002/(SICI)1097-0118(199603)21:3%3C351::AID-JGT11%3E3.0.CO;2-KzbMATH Open0845.05060OpenAlexW2037390311MaRDI QIDQ4875691FDOQ4875691

Niandong Shi, Gregory Cherlin

Publication date: 26 August 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199603)21:3%3C351::aid-jgt11%3E3.0.co;2-k

Recommendations

• Graphs omitting sums of complete graphs
• Cycles in triangle-free graphs
• Graphs without cycles of even length
• Cyclic deficiency of graphs
• scientific article; zbMATH DE number 1151859
• Graphs without four-cycles
• scientific article; zbMATH DE number 1933072
• Graphs without two vertex-disjoint \(S\)-cycles
• Publication:4726282
• Universal graphs omitting finitely many finite graphs

zbMATH Keywords

embeddingscyclesuniversal countable graph

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Paths and cycles (05C38)

Cited In (14)

• Many Facets of Dualities
• Nonexistence of universal graphs without some trees
• A note on classes of subgraphs of locally finite graphs
• Forbidden substructures and combinatorial dichotomies: WQO and universality
• All those Ramsey classes (Ramsey classes with closures and forbidden homomorphisms)
• Universal graphs with a forbidden subtree
• Stable generic structures
• Forbidden subgraphs and forbidden substructures
• Some remarks on universal graphs
• Bowtie‐free graphs and generic automorphisms
• Universal graphs with forbidden subgraphs and algebraic closure
• Cyclic automorphisms of a countable graph and random sum-free sets
• Graphs omitting sums of complete graphs
• There is no universal countable pentagon‐free graph

This page was built for publication: Graphs omitting a finite set of cycles

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