On the residue of a graph
From MaRDI portal
Publication:3970965
Recommendations
Cited in
(22)- Conjectures of TxGraffiti: independence, domination, and matchings
- Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT)
- Computers and discovery in algebraic graph theory
- \(k\)-domination and \(k\)-independence in graphs: A survey
- Largest domination number and smallest independence number of forests with given degree sequence
- Realizability and uniqueness in graphs
- Some eigenvalue properties in graphs (conjectures of Graffiti -- II)
- A lower bound on the independence number of a graph
- On zero-error codes produced by greedy algorithms
- scientific article; zbMATH DE number 6542389 (Why is no real title available?)
- Partitions of graphs into small and large sets
- The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination
- On linear and residual properties of graph products
- Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited
- Havel-Hakimi residues of unigraphs
- Graphs with the strong Havel-Hakimi property
- On the k-residue of disjoint unions of graphs with applications to k-independence
- Automated conjecturing. III. Property-relations conjectures
- Semi-regular graphs of minimum independence number
- scientific article; zbMATH DE number 3891427 (Why is no real title available?)
- Independence and the Havel-Hakimi residue
- MAX for \(k\)-independence in multigraphs
This page was built for publication: On the residue of a graph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3970965)
