Induced cycles in triangle graphs

DOI10.1016/j.dam.2015.12.012zbMath1339.05319arXiv1410.8807OpenAlexW2182371183WikidataQ59072392 ScholiaQ59072392MaRDI QIDQ298987

Aparna Lakshmanan S., Zsolt Tuza, Csilla Bujtás

Publication date: 21 June 2016

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1410.8807

zbMATH Keywords

perfect graphtriangle graph\(F\)-free graphTuza's conjecture

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Perfect graphs (05C17)

Related Items (5)

Triangle packings and transversals of some \(K_{4}\)-free graphs ⋮ Exact Solution Algorithms for the Chordless Cycle Problem ⋮ Edge clique partition in \((k,\ell)\)-graphs ⋮ Triangle packing and covering in dense random graphs ⋮ Characterizing 3-uniform linear extremal hypergraphs on feedback vertex number

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On rigid circuit graphs
• The strong perfect graph theorem
• Generalized line graphs: Cartesian products and complexity of recognition
• Intersection multigraphs of uniform hypergraphs
• On the triangle graph of a \(K(1,2,3)\)-free maximal planar graph
• Packing and covering triangles in tripartite graphs
• Old and new generalizations of line graphs
• On a conjecture of Tuza about packing and covering of triangles
• Small edge sets meeting all triangles of a graph
• A conjecture on triangles of graphs
• Tuza's conjecture for graphs with maximum average degree less than 7
• Clique Covering of Graphs IV. Algorithms
• Perfect k‐line graphs and k‐total graphs
• Perfect Triangle Families
• Characterizations of derived graphs

This page was built for publication: Induced cycles in triangle graphs