Complexite et circuits euleriens dans les sommes tensorielles de graphes

DOI10.1016/0095-8956(78)90021-7MaRDI QIDQ1220085zbMATH OpenOpenAlexFDO

Authors Germain Kreweras

Publication date 1978

Published in Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0095-8956(78)90021-7

Mathematics Subject Classification ID

Combinatorial aspects of matrices (incidence, Hadamard, etc.) (05B20) Trees (05C05) Enumeration in graph theory (05C30) Extremal problems in graph theory (05C35) Graph theory (05C99)

Cites work

• scientific article; zbMATH DE number 3338381 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• scientific article; zbMATH DE number 3091340 (Why is no real title available?)
• On Unicursal Paths in a Network of Degree 4

Cited in

(5)

• Aztec diamonds, checkerboard graphs, and spanning trees
• On the Minimum Number of Spanning Trees ink-Edge-Connected Graphs
• The Q-spectrum and spanning trees of tensor products of bipartite graphs
• The number of spanning trees in some classes of graphs
• Symmetry classes of spanning trees of aztec diamonds and perfect matchings of odd squares with a unit hole

This page was built for publication: Complexite et circuits euleriens dans les sommes tensorielles de graphes

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