A non-covering graph of girth six

DOI10.1016/0012-365X(87)90012-4zbMath0651.05046WikidataQ126470853 ScholiaQ126470853MaRDI QIDQ1106240

Oliver Pretzel

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

ordered setgraph of girth 6

Mathematics Subject Classification ID

Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Total orders (06A05)

Cites Work

• Unnamed Item
• Unnamed Item
• On graphs that can be oriented as diagrams of ordered sets
• A short proof of the existence of highly chromatic hypergraphs without short cycles
• On a Probabilistic Graph-Theoretical Method

This page was built for publication: A non-covering graph of girth six