Graph functionality (Q5919068)

From MaRDI portal

Jump to:navigation, search

scientific article; zbMATH DE number 7305042

Language	Label	Description	Also known as
English	Graph functionality	scientific article; zbMATH DE number 7305042

Statements

scholarly article

0 references

Graph functionality (English)

0 references

0 references

0 references

0 references

Journal of Combinatorial Theory. Series B

0 references

publication date

3 February 2021

0 references

full work available at URL

http://wrap.warwick.ac.uk/144973/1/WRAP-Graph-functionality-Lozin-2020.pdf

0 references

zbMATH Keywords

clique-width

0 references

permutation graph

0 references

hereditary class

0 references

graph representation

0 references

MaRDI profile type

MaRDI publication profile

0 references

Graph functionality

0 references

Dominating sets in \(k\)-majority tournaments.

0 references

Implicit representations and factorial properties of graphs

0 references

The speed of hereditary properties of graphs

0 references

Distance-hereditary graphs

0 references

Handle-rewriting hypergraph grammars

0 references

Linear time solvable optimization problems on graphs of bounded clique-width

0 references

Upper bounds to the clique width of graphs

0 references

ON THE CLIQUE-WIDTH OF SOME PERFECT GRAPH CLASSES

0 references

Line graphs of bounded clique-width

0 references

Recent advances in the theory and practice of logical analysis of data

0 references

Graph parameters and Ramsey theory

0 references

Efficient graph representations

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.jctb.2020.11.002

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:5919068

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q5919068&oldid=36650505"