S-packing chromatic vertex-critical graphs.
Premysl HolubMarko JakovacSandi KlavzarPublished in: Discret. Appl. Math. (2020)
Keyphrases
- undirected graph
- directed graph
- labeled graphs
- attributed graphs
- hamiltonian cycle
- graph matching
- vertex set
- maximum cardinality
- approximation algorithms
- edge weights
- connected subgraphs
- structured objects
- strongly connected
- graph representation
- graph databases
- graph theory
- bipartite graph
- data sets
- minimum spanning tree
- random graphs
- graph structures
- minimum weight
- complex structures
- spanning tree
- graph structure
- average degree
- pattern recognition
- search algorithm