Linear operators on graphs that preserve the clique cover number
From MaRDI portal
Publication:2799863
zbMATH Open1338.05261MaRDI QIDQ2799863FDOQ2799863
Authors: Leroy B. Beasley, David E. Brown 
Publication date: 13 April 2016
Published in: Congressus Numerantium (Search for Journal in Brave)
Recommendations
- scientific article; zbMATH DE number 3895101
- scientific article; zbMATH DE number 426153
- Linear operators preserving perimeters of undirected graphs
- Linear operators on graphs: genus preservers
- Clique coverings and partitions of line graphs
- scientific article; zbMATH DE number 4139797
- Clique covering and clique partition in generalizations of line graphs
- Linear operators strongly preserving digraphs whose maximum cycle length
- On clique graphs with linear size
- scientific article; zbMATH DE number 617588
Graph algorithms (graph-theoretic aspects) (05C85) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Cited In (8)
- Linear operators preserving perimeters of undirected graphs
- Title not available (Why is that?)
- Tree covers of graphs and their linear preservers
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Preservers of cover numbers and independence numbers of undirected graphs
This page was built for publication: Linear operators on graphs that preserve the clique cover number
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2799863)
