On the public citation graph

A conjecture on triangles of graphs

https://doi.org/10.1007/bf01787705
0 signed · 54 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf01849243openalex-snapshot
Upper bound for transversals of tripartite hypergraphs
inferredcites →https://doi.org/10.1007/bf02992776openalex-snapshot
On rigid circuit graphs
inferredcites →https://doi.org/10.1016/0012-365x(82)90040-1openalex-snapshot
Triangle-free partial graphs and edge covering theorems

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4531509openalex-extracted
On Tuza's Conjecture in Co-Chain Graphs
inferred← citeshttps://doi.org/10.1007/978-3-030-64843-5_29openalex-snapshot
Packing and Covering Triangles in Dense Random Graphs
inferred← citeshttps://doi.org/10.1007/978-3-319-44543-4_21openalex-snapshot
Sufficient Conditions for Tuza’s Conjecture on Packing and Covering Triangles
inferred← citeshttps://doi.org/10.1007/978-3-319-48749-6_10openalex-snapshot
Total Dual Integrality of Triangle Covering
inferred← citeshttps://doi.org/10.1007/978-3-319-97686-0_14openalex-snapshot
An Annotated Glossary of Graph Theory Parameters, with Conjectures
inferred← citeshttps://doi.org/10.1007/s00224-018-9860-7openalex-snapshot
Covering Triangles in Edge-Weighted Graphs
inferred← citeshttps://doi.org/10.1007/s00373-010-0881-5openalex-snapshot
Packing and Covering Triangles in Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00373-011-1048-8openalex-snapshot
Small Edge Sets Meeting all Triangles of a Graph
inferred← citeshttps://doi.org/10.1007/s00373-011-1071-9openalex-snapshot
Packing and Covering Triangles in K 4-free Planar Graphs
inferred← citeshttps://doi.org/10.1007/s00373-017-1798-zopenalex-snapshot
Fractional $$K_{4}$$ K 4 -Covers
inferred← citeshttps://doi.org/10.1007/s00373-018-1903-yopenalex-snapshot
Triangle Packings and Transversals of Some $$K_{4}$$ K 4 -Free Graphs
inferred← citeshttps://doi.org/10.1007/s00373-018-1986-5openalex-snapshot
Graph Edge Coloring: A Survey
inferred← citeshttps://doi.org/10.1007/s00373-020-02167-8openalex-snapshot
Packing and Covering Directed Triangles
inferred← citeshttps://doi.org/10.1007/s003730050010openalex-snapshot
Packing and Covering Triangles in Tripartite Graphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00859-wopenalex-snapshot
Triangle packing and covering in dense random graphs
inferred← citeshttps://doi.org/10.1007/s10878-022-00893-8openalex-snapshot
Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number
inferred← citeshttps://doi.org/10.1007/s40305-020-00335-4openalex-snapshot
Approximation Algorithms on k-Cycle Transversal and k-Clique Transversal
inferred← citeshttps://doi.org/10.1016/0012-365x(93)00228-wopenalex-snapshot
On a conjecture of Tuza about packing and covering of triangles
inferred← citeshttps://doi.org/10.1016/b978-044488002-4/50002-6openalex-snapshot
10.1016/b978-044488002-4/50002-6
inferred← citeshttps://doi.org/10.1016/j.dam.2010.05.027openalex-snapshot
Packing and covering tetrahedra
inferred← citeshttps://doi.org/10.1016/j.dam.2015.12.012openalex-snapshot
Induced cycles in triangle graphs
inferred← citeshttps://doi.org/10.1016/j.dam.2016.12.025openalex-snapshot
Recent techniques and results on the Erdős–Pósa property
inferred← citeshttps://doi.org/10.1016/j.dam.2025.06.049openalex-snapshot
On Tuza’s conjecture in dense graphs
inferred← citeshttps://doi.org/10.1016/j.disc.2017.02.020openalex-snapshot
Maximal k -edge-colorable subgraphs, Vizing’s Theorem, and Tuza’s Conjecture
inferred← citeshttps://doi.org/10.1016/j.disc.2020.111825openalex-snapshot
The geometry and combinatorics of discrete line segment hypergraphs
inferred← citeshttps://doi.org/10.1016/j.disc.2020.112281openalex-snapshot
On Tuza’s conjecture for triangulations and graphs with small treewidth
inferred← citeshttps://doi.org/10.1016/j.ejc.2011.09.024openalex-snapshot
A stability theorem on fractional covering of triangles by edges
inferred← citeshttps://doi.org/10.1016/j.ejc.2015.03.006openalex-snapshot
Tuza’s Conjecture for graphs with maximum average degree less than 7
inferred← citeshttps://doi.org/10.1016/j.ejc.2021.103462openalex-snapshot
Packing and covering directed triangles asymptotically
inferred← citeshttps://doi.org/10.1016/j.entcs.2019.08.016openalex-snapshot
On Tuza's Conjecture for Triangulations and Graphs with Small Treewidth
inferred← citeshttps://doi.org/10.1016/j.orl.2014.01.003openalex-snapshot
A semidefinite approach to the -cover problem
inferred← citeshttps://doi.org/10.1016/s0012-365x(98)00183-6openalex-snapshot
Packing and covering triangles in graphs
inferred← citeshttps://doi.org/10.1016/s0095-8956(03)00078-9openalex-snapshot
Edge-disjoint odd cycles in planar graphs
inferred← citeshttps://doi.org/10.1112/blms/26.4.321openalex-snapshot
Perfect Triangle Families
inferred← citeshttps://doi.org/10.1137/1.9781611975994.121openalex-snapshot
Multi-transversals for Triangles and the Tuza's Conjecture
inferred← citeshttps://doi.org/10.1137/1.9781611977073.40openalex-snapshot
Approximate Hypergraph Vertex Cover and generalized Tuza's conjecture
inferred← citeshttps://doi.org/10.1137/100803869openalex-snapshot
Packing Triangles in Weighted Graphs
inferred← citeshttps://doi.org/10.1137/110845835openalex-snapshot
Min-Max Relations for Odd Cycles in Planar Graphs
inferred← citeshttps://doi.org/10.1137/22m1511229openalex-snapshot
Tuza’s Conjecture for Binary Geometries
inferred← citeshttps://doi.org/10.1137/22m1534134openalex-snapshot
Packing and Covering a Given Directed Graph in a Directed Graph
inferred← citeshttps://doi.org/10.1137/23m1570351openalex-snapshot
Approximate Hypergraph Vertex Cover and Generalized Tuza’s Conjecture
inferred← citeshttps://doi.org/10.1137/23m1587014openalex-snapshot
Generalized Tuza’s Conjecture for Random Hypergraphs
inferred← citeshttps://doi.org/10.11606/t.45.2020.tde-10012020-200714openalex-snapshot
Transversals of graphs
inferred← citeshttps://doi.org/10.37236/10829openalex-snapshot
Improved Bounds on a Generalization of Tuza's Conjecture
inferred← citeshttps://doi.org/10.37236/13355openalex-snapshot
New Bounds on a Generalization of Tuza’s Conjecture
inferred← citeshttps://doi.org/10.48550/arxiv.1012.0372openalex-snapshot
Packing triangles in weighted graphs
inferred← citeshttps://doi.org/10.48550/arxiv.1410.8807openalex-snapshot
Induced cycles in triangle graphs
inferred← citeshttps://doi.org/10.48550/arxiv.2002.07925openalex-snapshot
On Tuza's conjecture for triangulations and graphs with small treewidth
inferred← citeshttps://doi.org/10.5753/etc.2018.3141openalex-snapshot
On Tuza's conjecture for graphs with treewidth at most 6
inferred← citeshttps://doi.org/10.5753/etc.2022.223185openalex-snapshot
On Tuza's conjecture in even co-chain graphs
inferred← citeshttps://doi.org/10.70675/658f0687ze25fz44e7z9761z187dd29af957openalex-snapshot
Structural and algorithmic aspects of partial orderings of graphs
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.