Multigraphs with a unique partition into cycles

DOI10.7151/DMGT.2627MaRDI QIDQ7395476zbMATH OpenFDO

Authors Joshua Cooper, Utku Okur

Publication date 2026

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2627

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Paths and cycles (05C38) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75)

Cites work

• A Theorem on Graphs, with an Application to a Problem of Traffic Control
• An Algorithm to Construct Greedy Drawings of Triangulations
• An application of modular equations in analysis situs.
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• Estimations for the number of cycles in a graph
• Graph theory
• Graph theory
• Graph theory and its applications
• scientific article; zbMATH DE number 699389 (Why is no real title available?)
• scientific article; zbMATH DE number 3290993 (Why is no real title available?)
• scientific article; zbMATH DE number 3068971 (Why is no real title available?)
• On the Number of Husimi Trees
• On the numbers of spanning trees and Eulerian tours in generalized de Bruijn graphs
• Simplicity in Eulerian circuits: uniqueness and safety
• Some results on greedy embeddings in metric spaces
• Split-decomposition trees with prime nodes: enumeration and random generation of cactus graphs
• The interlace polynomial of a graph
• Topics in Intersection Graph Theory
• Vertex and edge metric dimensions of cacti

This page was built for publication: Multigraphs with a unique partition into cycles

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