Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality

DOI10.1016/0095-8956(82)90056-9zbMath0506.05047OpenAlexW2055292836MaRDI QIDQ1836675

Michel Las Vergnas, Belmannu Devadas Acharya

Publication date: 1982

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(82)90056-9

zbMATH Keywords

cyclomatic numbercharacteristic numberweighted intersection graph

Mathematics Subject Classification ID

Hypergraphs (05C65)

Related Items

The cyclicity of a hypergraph ⋮ Finding intersection models: from chordal to Helly circular-arc graphs ⋮ Subgraph trees in graph theory ⋮ On some partial line graphs of a hypergraph and the associated matroid ⋮ Weak edge-degree domination in hypergraphs ⋮ The enumeration of spanning tree of weighted graphs ⋮ A class of hypergraphs satisfying an inequality of Lovasz ⋮ On intersection multigraphs of hypergraphs ⋮ A characterization of totally balanced hypergraphs ⋮ Enumeration of maximum acyclic hypergraphs

Cites Work

• On rigid circuit graphs
• On hypergraphs without significant cycles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Hypergraphs with cyclomatic number zero, triangulated graphs, and an inequality