• Home
  • Search
  • Lattices generated by Chip Firing Game models: Criteria and recognition algorithms
  • Cite Icon6
  • https://doi.org/10.1016/j.ejc.2012.12.008Copy DOI Icon

Lattices generated by Chip Firing Game models: Criteria and recognition algorithms

Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Lattices generated by Chip Firing Game models: Criteria and recognition algorithms

Similar Papers
  • Supplementary Content

Extremal Graph Theory for Minors, Improper Colourings and Gonality

  • Mar 21, 2019
  • Kevin Hendrey
  • Conference Article

A Polynomial-Time Algorithm for Reachability Problem of a Subclass of Petri Net and Chip Firing Games

  • Feb 01, 2012
  • Manh Ha Le +2
  • Research Article
  • Citations101

The Tutte polynomial

  • Oct 01, 1999
  • Random Structures and Algorithms
  • Dominic Welsh
  • Research Article
  • Citations6

The chip firing game onn-cycles

  • Mar 01, 1995
  • Graphs and Combinatorics
  • Janice Jeffs +1
  • Research Article
  • Citations6

Bipartite bithreshold graphs

  • Aug 01, 1993
  • Discrete Mathematics
  • Peter L Hammer
  • Research Article
  • Citations20

HOLES AND DOMINOES IN MEYNIEL GRAPHS

  • Jun 01, 1999
  • International Journal of Foundations of Computer Science
  • Florian Roussel +1
  • Book Chapter
  • Citations5

Fast Fixed-Parameter Tractable Algorithms for Nontrivial Generalizations of Vertex Cover

  • Jan 01, 2001
  • Naomi Nishimura +2
  • Book Chapter

An Introduction to Coding Sequences of Graphs

  • Jan 01, 2016
  • Shamik Ghosh +2
  • Research Article
  • Citations1

On CD-chromatic number and its lower bound in some classes of graphs

  • Feb 05, 2024
  • Discrete Applied Mathematics
  • Shalu M.A +1
  • PDF
  • Research Article
  • Citations3

Quasimonotone graphs

  • Sep 02, 2019
  • Discrete Applied Mathematics
  • Martin Dyer +1
  • Book Chapter
  • Citations56

Computing treewidth and minimum fill-in: All you need are the minimal separators

  • Jan 01, 1993
  • T Kloks +3
  • Research Article
  • Citations12

Exploring the complexity boundary between coloring and list-coloring

  • Jul 24, 2006
  • Electronic Notes in Discrete Mathematics
  • Flavia Bonomo +2
  • Research Article

Mind the independence gap

  • May 07, 2020
  • Discrete Mathematics
  • Tınaz Ekim +3
  • Conference Article
  • Citations4

Lacon- and Shrub-Decompositions: A New Characterization of First-Order Transductions of Bounded Expansion Classes

  • Jun 29, 2021
  • Jan Dreier
  • Research Article
  • Citations31

A faster algorithm to recognize undirected path graphs

  • Jun 01, 1993
  • Discrete Applied Mathematics
  • Alejandro A Schäffer
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.