Cycles of length 1 modulo 3 in graph

DOI10.1016/S0166-218X(01)00190-1MaRDI QIDQ5951978zbMATH OpenOpenAlexFDO

Authors Mei Lu, Zhengguang Yu

Publication date 14 August 2002

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

Full work available at URL https://doi.org/10.1016/s0166-218x(01)00190-1

zbMATH Keywords

chordconjecture of SaitocyclePetersen graph

Mathematics Subject Classification ID

Paths and cycles (05C38)

Recommendations

• Cycles of length 2 modulo 3 in graphs
• scientific article; zbMATH DE number 1472141
• scientific article; zbMATH DE number 867680
• On a conjecture concerning the Petersen graph
• Graphs with a cycle of length divisible by three

Cites work

• Cycles of length 2 modulo 3 in graphs
• Graph theory

Cited in

(8)

• Cycles of length 2 modulo 3 in graphs
• scientific article; zbMATH DE number 1472141 (Why is no real title available?)
• A strengthening on odd cycles in graphs of given chromatic number
• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
• 4-Chromatic graphs have at least four cycles of length 0 mod 3
• On graphs without cycles of length 0 modulo 4
• Maximum number of cliques in \(\{C_{k_1}, C_{k_2}, C_{k_3}, \cdots \}\)-free graphs with \(6 = k_1 < k_2 < \cdots\) and \(k_{i+1} - k_i \leq 5\)

This page was built for publication: Cycles of length 1 modulo 3 in graph

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