Independent triangles covering given vertices of a graph

DOI10.1016/S0304-3975(00)00253-XMaRDI QIDQ5941524zbMATH OpenOpenAlexWikidataFDO

Authors Hao Li, Jianping 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 degreesimple graphindependent triangles

Mathematics Subject Classification ID

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

Recommendations

• Independent sets in graphs with triangles
• Triangles and neighbourhoods of independent sets in graphs
• Independent Domination in Triangle Graphs
• Covering and independence in triangle structures
• Triangle-free graphs whose independence number equals the degree
• Finding Independent Sets in Triangle-Free Graphs
• Independent domination in triangle-free graphs
• scientific article; zbMATH DE number 5593359
• scientific article; zbMATH DE number 15378
• Independent directed triangles in a directed graph

Cites work

• scientific article; zbMATH DE number 3652373 (Why is no real title available?)
• scientific article; zbMATH DE number 749260 (Why is no real title available?)
• scientific article; zbMATH DE number 3344609 (Why is no real title available?)
• Covering a graph with cycles passing through given edges
• Degree conditions for 2-factors
• Graph theory
• On the maximal number of independent circuits in a graph
• On the maximal number of independent triangles in graphs

Cited in

(4)

• Triangle-tilings in graphs without large independent sets
• Independent directed triangles in a directed graph
• Disjoint triangles and pentagons in a graph
• The minimum number of triangles covering the edges of a graph

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

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