scientific article; zbMATH DE number 3487498
From MaRDI portal
Publication:4071280
Cited in
(14)- Computational aspects of greedy partitioning of graphs
- The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class
- On characterizations by nice forbidding sets
- On classes of graphs determined by forbidden subgraphs
- Graph-based data clustering with overlaps
- Cycle stochastic graphs: structural and forbidden graph characterizations
- Forbidden structures for planar perfect consecutively colourable graphs
- Graph-Based Data Clustering with Overlaps
- A Complexity Dichotomy for Finding Disjoint Solutions of Vertex Deletion Problems
- Editing graphs into disjoint unions of dense clusters
- On cycle graphs
- Automated generation of conjectures on forbidden subgraph characterization
- On degree sequences and eccentricities in pseudoline arrangement graphs
- On invariants of hereditary graph properties
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4071280)