Characterizing almost-median graphs (Q872051)

From MaRDI portal

Revision as of 15:33, 25 June 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	Characterizing almost-median graphs	scientific article

Statements

scholarly article

0 references

Characterizing almost-median graphs (English)

0 references

Boštjan Brešar

0 references

European Journal of Combinatorics

0 references

publication date

27 March 2007

0 references

MaRDI profile type

MaRDI publication profile

0 references

full work available at URL

https://doi.org/10.1016/j.ejc.2005.10.009

0 references

Quasi‐median graphs and algebras

0 references

Partial Hamming graphs and expansion procedures

0 references

Fast recognition algorithms for classes of partial cubes

0 references

Tiled partial cubes

0 references

Quasi-median graphs, their generalizations, and tree-like equalities

0 references

Distance-preserving subgraphs of hypercubes

0 references

A convexity lemma and expansion procedures for bipartite graphs

0 references

0 references

Fast recognition of classes of almost-median graphs

0 references

0 references

0 references

Isometric embedding in products of complete graphs

0 references

Identifiers

zbMATH Open document ID

0 references

10.1016/j.ejc.2005.10.009

0 references

Mathematics Subject Classification ID

0 references

0 references

zbMATH DE Number

0 references

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:872051

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