On the independence graph of a graph

DOI10.1016/S0012-365X(03)00194-8zbMath1028.05073OpenAlexW2022023572MaRDI QIDQ1412670

Boštjan Brešar, Blaž Zmazek

Publication date: 25 November 2003

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

Full work available at URL: https://doi.org/10.1016/s0012-365x(03)00194-8

zbMATH Keywords

Cartesian productStable setGraphIndependent setHomomorphismIntersection graph

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Graph representations (geometric and intersection representations, etc.) (05C62)

Related Items (3)

Graphs with a unique maximum independent set up to automorphisms ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees ⋮ On the packing chromatic number of Cartesian products, hexagonal lattice, and trees

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graphs with unique maximum independent sets
• Independence ratios of graph powers
• The structure and maximum number of maximum independent sets in trees
• Independence numbers of product graphs
• The number of maximum independent sets in graphs

This page was built for publication: On the independence graph of a graph