The size of graphs with clique number \(m\) and without nowhere-zero 4-flows

DOI10.1016/0012-365X(95)00341-SzbMATH Open0869.05065OpenAlexW1985884106MaRDI QIDQ1356551

Zhi-Hong Chen

Publication date: 9 June 1997

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

Full work available at URL: https://doi.org/10.1016/0012-365x(95)00341-s

zbMATH Keywords

reductionPetersen graphreduced graphnowhere-zero 4-flowcollapsible subgraphs

Mathematics Subject Classification ID

Graph theory (05C99)

Cites Work

• Double cycle covers and the petersen graph
• A reduction method to find spanning Eulerian subgraphs
• The size of graphs without nowhere‐zero 4‐flows
• Unnamed Item
• Unnamed Item

This page was built for publication: The size of graphs with clique number \(m\) and without nowhere-zero 4-flows