Homogeneously orderable graphs (Q1392023)

From MaRDI portal

Revision as of 12:22, 28 May 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)

(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Homogeneously orderable graphs	scientific article

Statements

scholarly article

0 references

Homogeneously orderable graphs (English)

0 references

Andreas Brandstädt

0 references

Feodor F. Dragan

0 references

0 references

Theoretical Computer Science

0 references

publication date

23 July 1998

0 references

zbMATH Keywords

homogeneously orderable graphs

0 references

MaRDI profile type

MaRDI publication profile

0 references

Distance-hereditary graphs

0 references

Pseudo-modular graphs

0 references

0 references

A linear-time algorithm for connectedr-domination and Steiner tree on distance-hereditary graphs

0 references

Clique r-Domination and Clique r-Packing Problems on Dually Chordal Graphs

0 references

Distance-Hereditary Graphs, Steiner Trees, and Connected Domination

0 references

0 references

Dominating cliques in distance-hereditary graphs

0 references

0 references

0 references

0 references

Hypergraphes arbores

0 references

0 references

Completely separable graphs

0 references

Weakly triangulated graphs

0 references

Erratum: Optimizing weakly triangulated graphs. [Graphs and Combinatorics 5, 339-349 (1989)]

0 references

A CHARACTERIZATION OF DISTANCE-HEREDITARY GRAPHS

0 references

On the semi-perfect elimination

0 references

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/S0304-3975(96)00091-6

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:1392023

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