Cycles of length 1 modulo 3 in graph

DOI10.1016/S0166-218X(01)00190-1zbMATH Open0990.05087OpenAlexW2117929796MaRDI QIDQ5951978FDOQ5951978

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

Recommendations

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

zbMATH Keywords

cyclePetersen graphchordconjecture of Saito

Mathematics Subject Classification ID

Paths and cycles (05C38)

Cites Work

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

Cited In (6)

• A strengthening on odd cycles in graphs of given chromatic number
• 4-Chromatic graphs have at least four cycles of length 0 mod 3
• Cycle lengths modulo \(k\) in large 3-connected cubic graphs
• Cycles of length 2 modulo 3 in graphs
• HOW MANY n-CYCLES DOES PERIOD 3 IMPLY? AN ELEMENTARY APPROACH
• Title not available (Why is that?)

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)