On some algorithmic investigations of star partitions of graphs
From MaRDI portal
(Redirected from Publication:1900141)
Recommendations
Cites work
- A study of eigenspaces of graphs
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- scientific article; zbMATH DE number 3717357 (Why is no real title available?)
- scientific article; zbMATH DE number 3606506 (Why is no real title available?)
- scientific article; zbMATH DE number 510845 (Why is no real title available?)
- Matching theory
- Matroid Intersection
- Recent results in the theory of graph spectra
- The symbiotic relationship of combinatorics and matrix theory
- TWO THEOREMS IN GRAPH THEORY
Cited in
(7)- Star partitions and regularity in graphs
- scientific article; zbMATH DE number 510845 (Why is no real title available?)
- Dominating Sets and Eigenvalues of Graphs
- Star partitions and the graph isomorphism problem
- scientific article; zbMATH DE number 7366808 (Why is no real title available?)
- Graphs for small multiprocessor interconnection networks
- On the isomorphism of graphs having some eigenvalues of moderate multiplicity
This page was built for publication: On some algorithmic investigations of star partitions of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1900141)