On the residue of a graph

DOI10.1002/jgt.3190150107zbMath0751.05075OpenAlexW1994682813MaRDI QIDQ3970965

Jean-François Saclé, Odile Favaron, Maryvonne Maheo

Publication date: 25 June 1992

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.3190150107

zbMATH Keywords

simple graphresiduecomputer program GRAFFITI

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (19)

Largest domination number and smallest independence number of forests with given degree sequence ⋮ Realizability and uniqueness in graphs ⋮ Graphs with the strong Havel-Hakimi property ⋮ Conjecture of TxGraffiti: Independence, domination, and matchings ⋮ On the \(k\)-residue of disjoint unions of graphs with applications to \(k\)-independence ⋮ Automated conjecturing. III. Property-relations conjectures ⋮ Automated conjecturing. I: Fajtlowicz's Dalmatian heuristic revisited ⋮ Semi-regular graphs of minimum independence number ⋮ Partitions of graphs into small and large sets ⋮ \(k\)-domination and \(k\)-independence in graphs: A survey ⋮ Some eigenvalue properties in graphs (conjectures of Graffiti -- II) ⋮ The Slater and sub-\(k\)-domination number of a graph with applications to domination and \(k\)-domination ⋮ MAX for \(k\)-independence in multigraphs ⋮ Havel-Hakimi residues of unigraphs ⋮ On zero-error codes produced by greedy algorithms ⋮ A lower bound on the independence number of a graph ⋮ Computers and discovery in algebraic graph theory ⋮ Time-relaxed Multi-Broadcasting in Communication Networks (EXTENDED ABSTRACT) ⋮ Independence and the Havel-Hakimi residue

Cites Work

• Unnamed Item

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