Join of two graphs admits a nowhere-zero 3-flow.

DOI10.1007/S10587-014-0110-0zbMATH Open1340.05095OpenAlexW2052262390MaRDI QIDQ2940652FDOQ2940652

Authors: S. Akbari, M. Aliakbarpour, Naryam Ghanbari, E. Nategh, Hossein Shahmohamad 

Publication date: 27 January 2015

Published in: Czechoslovak Mathematical Journal (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10587-014-0110-0

Recommendations

• Flows on the join of two graphs
• Minimum degree and nowhere-zero 3-flows
• Degree sum and nowhere-zero 3-flows
• Nowhere-zero 3-flows and \(Z_{3}\)-connectivity of a family of graphs
• Nowhere-zero flows in tensor product of graphs

zbMATH Keywords

join of two graphsminimum nowhere-zero flow numbernowhere-zero \(\lambda \)-flow

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Flows in graphs (05C21) Graph operations (line graphs, products, etc.) (05C76) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• A Contribution to the Theory of Chromatic Polynomials
• Flows and generalized coloring theorems in graphs
• Nowhere-zero 4-flows; simultaneous edge-colorings; and critical partial Latin squares
• Nowhere-zero 6-flows
• On the Imbedding of Linear Graphs in Surfaces
• Title not available (Why is that?)
• Non-separating induced cycles in graphs

Cited In (1)

• Title not available (Why is that?)

This page was built for publication: Join of two graphs admits a nowhere-zero \(3\)-flow.

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