Construction of graphs with given circular flow numbers

DOI10.1002/JGT.10124MaRDI QIDQ4422617zbMATH OpenOpenAlexFDO

Authors Zhishi Pan, Xuding Zhu

Publication date 20 August 2003

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.10124

zbMATH Keywords

parallel joinseries jointwo-terminal graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Recommendations

• scientific article; zbMATH DE number 3904637
• On circular flows of graphs
• The Set of Circular Flow Numbers of Regular Graphs
• Circular flow numbers of regular multigraphs
• Circular flows in planar graphs
• Determining the circular flow number of a cubic graph
• The Construction of Certain Graphs
• scientific article; zbMATH DE number 861402
• Construction of a class of loops via graphs.
• On the construction of certain graphs

Cited in

(10)

• The circular flow number of a 6-edge connected graph is less than four
• Circular flow number of generalized Blanuša snarks
• Asymptotic lower bounds on circular chromatic index of snarks
• Superposition of snarks revisited
• The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem
• Snarks with given real flow numbers
• Flows and parity subgraphs of graphs with large odd-edge-connectivity
• Edge Colorings and Circular Flow Numbers of Regular Graphs
• The Set of Circular Flow Numbers of Regular Graphs
• A unified approach to construct snarks with circular flow number 5

This page was built for publication: Construction of graphs with given circular flow numbers

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