Elimination schemes and lattices

DOI10.1016/j.disc.2014.03.024zbMath1288.05181OpenAlexW2019436781MaRDI QIDQ2449178

Margaret-Ellen Messinger, Richard J. Nowakowski, Paweł Prałat

Publication date: 6 May 2014

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

Full work available at URL: https://doi.org/10.1016/j.disc.2014.03.024

zbMATH Keywords

chordal graphssearchingcop numberbrush numberchip-firing\(k\)-coresupper locally distributive latticedomination elimination orderingpse-orderingsimplicial elimination ordering

Mathematics Subject Classification ID

Structure and representation theory of distributive lattices (06D05) Graph representations (geometric and intersection representations, etc.) (05C62) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Games on graphs (graph-theoretic aspects) (05C57)

Related Items

Brushing with additional cleaning restrictions, Brushing without capacity restrictions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Cleaning a network with brushes
• Parallel cleaning of a network with brushes
• Clean the graph before you draw it!
• Classes of lattices induced by chip firing (and sandpile) dynamics.
• Vertex-to-vertex pursuit in a graph
• \textsc{polish} -- Let us play the cleaning game
• Lattices generated by chip firing game models: criteria and recognition algorithms
• On the threshold for \(k\)-regular subgraphs of random graphs
• Tandem-win graphs
• Graph Classes: A Survey
• Algebraic aspects of Abelian sandpile models
• Cleaning Regular Graphs with Brushes
• The lattice structure of chip firing games and related models