Recommendations
Cites work
- Distance-hereditary graphs
- Dominating sets in \(k\)-majority tournaments.
- Efficient graph representations
- Graph functionality
- Graph parameters and Ramsey theory
- Handle-rewriting hypergraph grammars
- Implicit representations and factorial properties of graphs
- Line graphs of bounded clique-width
- Linear time solvable optimization problems on graphs of bounded clique-width
- On the clique-width of some perfect graph classes
- Recent advances in the theory and practice of logical analysis of data
- The speed of hereditary properties of graphs
- Upper bounds to the clique width of graphs
Cited in
(8)- Graph parameters, implicit representations and factorial properties
- Graph functionality
- Functionality of box intersection graphs
- Logical labeling schemes
- Graph parameters, implicit representations and factorial properties
- Optimal adjacency labels for subgraphs of Cartesian products
- Graph problems and monotone classes
- Symmetric-difference (degeneracy) and signed tree models
This page was built for publication: Graph functionality
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919068)