Independent triangles covering given vertices of a graph

DOI10.1016/S0304-3975(00)00253-XzbMath0972.05039OpenAlexW2059212567WikidataQ126353176 ScholiaQ126353176MaRDI QIDQ5941524

Jianping Li, Hao Li

Publication date: 20 August 2001

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0304-3975(00)00253-x

zbMATH Keywords

minimum degreeindependent trianglessimple graph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cites Work

• On the maximal number of independent triangles in graphs
• Degree conditions for 2-factors
• Covering a graph with cycles passing through given edges
• On the maximal number of independent circuits in a graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Independent triangles covering given vertices of a graph