Complexite et circuits euleriens dans les sommes tensorielles de graphes

DOI10.1016/0095-8956(78)90021-7zbMath0313.05114OpenAlexW1991493078MaRDI QIDQ1220085

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

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

Related Items (5)

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

Cites Work

• On Unicursal Paths in a Network of Degree 4
• Unnamed Item
• Unnamed Item
• Unnamed Item

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