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

DOI10.1016/0095-8956(82)90056-9zbMATH Open0506.05047OpenAlexW2055292836MaRDI QIDQ1836675FDOQ1836675

Michel Las Vergnas, B. D. 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)

Cites Work

• Title not available (Why is that?)
• On rigid circuit graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• On hypergraphs without significant cycles

Cited In (10)

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

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

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