scientific article; zbMATH DE number 4087710

MaRDI QIDQ3816110zbMATH OpenFDO

Authors Ming-kun Zhou

Publication date 1987

zbMATH Keywords

circuit covercircuit polynomial

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph theory (05C99)

Recommendations

• scientific article; zbMATH DE number 3859168
• scientific article; zbMATH DE number 3931061
• A graph integral formulation of the circuit partition polynomial
• On circuits in graphs
• On the character of the matching polynomial and its application to circuit characterization of graphs
• ON THE VERTEX CONNECTIVITY POLYNOMIAL OF GRAPHS
• A circuit characterization of graphic matroids
• scientific article; zbMATH DE number 3966096
• Bounding the number of circuits of a graph

Cited in

(13)

• Evaluations of the circuit partition polynomial
• Graver degrees are not polynomially bounded by true circuit degrees
• On coefficients of path polynomials
• A note on circuit graphs
• The circuit polynomial of the restricted rooted product G( ) of graphs with a bipartite core G
• scientific article; zbMATH DE number 3859168 (Why is no real title available?)
• scientific article; zbMATH DE number 3931061 (Why is no real title available?)
• scientific article; zbMATH DE number 3974986 (Why is no real title available?)
• scientific article; zbMATH DE number 109189 (Why is no real title available?)
• Path polynomials of a circuit: a constructive approach
• scientific article; zbMATH DE number 1052837 (Why is no real title available?)
• The cycle (circuit) polynomial of a graph with double and triple weights of edges and cycles
• Path decompositions of chains and circuits

This page was built for publication:

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