Containment orders–a lifelong journey

Martin Charles Golumbic

doi:10.1080/09728600.2024.2334799

Containment orders–a lifelong journey

Martin Charles Golumbic

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

Abstract

Mathematical explorations steer us through fields and forests of applications where science and computing meet discrete structures and combinatorics. Today’s excursion takes us on one of the speaker’s favorite journeys in the world of algorithmic graph theory–containment orders, treelike orders and their comparability graphs.

Original language	English
Journal	AKCE International Journal of Graphs and Combinatorics
DOIs	https://doi.org/10.1080/09728600.2024.2334799
State	Accepted/In press - 2024

Bibliographical note

Publisher Copyright:
© 2024 The Author(s). Published with license by Taylor & Francis Group, LLC.

Keywords

CPT graphs
Comparability graphs
containment graphs
ordered sets
posets
trivially perfect graphs paths in a tree

ASJC Scopus subject areas

Discrete Mathematics and Combinatorics

Access to Document

10.1080/09728600.2024.2334799

Cite this

@article{05bca268b46e46229d8268ee3e81d530,

title = "Containment orders–a lifelong journey",

abstract = "Mathematical explorations steer us through fields and forests of applications where science and computing meet discrete structures and combinatorics. Today{\textquoteright}s excursion takes us on one of the speaker{\textquoteright}s favorite journeys in the world of algorithmic graph theory–containment orders, treelike orders and their comparability graphs.",

keywords = "CPT graphs, Comparability graphs, containment graphs, ordered sets, posets, trivially perfect graphs paths in a tree",

author = "Golumbic, {Martin Charles}",

note = "Publisher Copyright: {\textcopyright} 2024 The Author(s). Published with license by Taylor & Francis Group, LLC.",

year = "2024",

doi = "10.1080/09728600.2024.2334799",

language = "English",

journal = "AKCE International Journal of Graphs and Combinatorics",

issn = "0972-8600",

publisher = "Kalasalingam University",

}

TY - JOUR

T1 - Containment orders–a lifelong journey

AU - Golumbic, Martin Charles

PY - 2024

Y1 - 2024

N2 - Mathematical explorations steer us through fields and forests of applications where science and computing meet discrete structures and combinatorics. Today’s excursion takes us on one of the speaker’s favorite journeys in the world of algorithmic graph theory–containment orders, treelike orders and their comparability graphs.

AB - Mathematical explorations steer us through fields and forests of applications where science and computing meet discrete structures and combinatorics. Today’s excursion takes us on one of the speaker’s favorite journeys in the world of algorithmic graph theory–containment orders, treelike orders and their comparability graphs.

KW - CPT graphs

KW - Comparability graphs

KW - containment graphs

KW - ordered sets

KW - posets

KW - trivially perfect graphs paths in a tree

UR - http://www.scopus.com/inward/record.url?scp=85189990712&partnerID=8YFLogxK

U2 - 10.1080/09728600.2024.2334799

DO - 10.1080/09728600.2024.2334799

M3 - Article

AN - SCOPUS:85189990712

SN - 0972-8600

JO - AKCE International Journal of Graphs and Combinatorics

JF - AKCE International Journal of Graphs and Combinatorics

ER -

Containment orders–a lifelong journey

Abstract

Bibliographical note

Keywords

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this