UB Paderborn / Katalog / Suche / in CDI

Eating healthier: Exploring nutrition information for healthier recipe recommendation

Information processing & management, 2020-11, Vol.57 (6), p.102051, Article 102051

2020

Volltextzugriff (PDF)

Dichotomizing k-vertex-critical H-free graphs for H of order four

Discrete Applied Mathematics, 2022-05, Vol.312, p.106-115

2022

Volltextzugriff (PDF)

On the structure of (banner, odd hole)‐free graphs

Journal of graph theory, 2018-12, Vol.89 (4), p.395-412

Hoàng, Chính T.

2018

Volltextzugriff (PDF)

On the structure of (pan, even hole)‐free graphs

Journal of graph theory, 2018-01, Vol.87 (1), p.108-129

2018

Volltextzugriff (PDF)

On color-critical (P5,co-P5)-free graphs

Discrete Applied Mathematics, 2017-01, Vol.216, p.142-148

2017

Volltextzugriff (PDF)

Chromatic symmetric functions and H-free graphs

Graphs and combinatorics, 2019-07, Vol.35 (4), p.815-825

2019

Volltextzugriff (PDF)

A refinement on the structure of vertex-critical (P5, gem)-free graphs

Theoretical computer science, 2023-06, Vol.961, p.113936, Article 113936

2023

Volltextzugriff (PDF)

On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem

Theoretical computer science, 2007-12, Vol.389 (1), p.295-306

2007

Volltextzugriff (PDF)

Finding and listing induced paths and cycles

Discrete Applied Mathematics, 2013-03, Vol.161 (4-5), p.633-641

2013

Volltextzugriff (PDF)

The Intersection of Two Vertex Coloring Problems

Graphs and combinatorics, 2020, Vol.36 (1), p.125-138

2020

Volltextzugriff (PDF)

A class of graphs with large rankwidth

Discrete mathematics, 2024-01, Vol.347 (1), p.113699, Article 113699

2024

Volltextzugriff (PDF)

A Closure Lemma for tough graphs and Hamiltonian degree conditions

Discrete mathematics, 2024-04, Vol.347 (4), p.113872, Article 113872

2024

Volltextzugriff (PDF)

On the Structure of (Even Hole, Kite)-Free Graphs

Graphs and combinatorics, 2018-09, Vol.34 (5), p.989-999

2018

Volltextzugriff (PDF)

Vertex-critical ( P 3 + ℓ P 1 ) -free and vertex-critical (gem, co-gem)-free graphs

Discrete Applied Mathematics, 2024-02, Vol.344, p.179-187

2024

Volltextzugriff (PDF)

A Characterization of b-Perfect Graphs

Journal of graph theory, 2012-09, Vol.71 (1), p.95-122

2012

Volltextzugriff (PDF)

Maximum Induced Matchings for Chordal Graphs in Linear Time

Algorithmica, 2008-12, Vol.52 (4), p.440-447

2008

Volltextzugriff (PDF)

On coloring a class of claw-free and hole-twin-free graphs

Discrete Applied Mathematics, 2022-12, Vol.323, p.162-170

2022

Volltextzugriff (PDF)

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

Discrete mathematics, 2011-03, Vol.311 (6), p.431-434

2011

Volltextzugriff (PDF)

Classes of Graphs with $e$-Positive Chromatic Symmetric Function

The Electronic journal of combinatorics, 2019-09, Vol.26 (3)

2019

Volltextzugriff (PDF)

Edge intersection graphs of L-shaped paths in grids

Discrete Applied Mathematics, 2016-09, Vol.210, p.185-194

2016

Volltextzugriff (PDF)

Solving the clique cover problem on (bull, C4)-free graphs

Discrete Applied Mathematics, 2019-05, Vol.261, p.119-122

2019

Volltextzugriff (PDF)

Characterizing directed path graphs by forbidden asteroids

Journal of graph theory, 2011-10, Vol.68 (2), p.103-112

2011

Volltextzugriff (PDF)

On the Structure of Graphs Without Claw, 4K1 and co-R

Graphs and combinatorics, 2022, Vol.38 (4)

2022

Volltextzugriff (PDF)

Constructions of -critical -free graphs

Discrete Applied Mathematics, 2015-02, Vol.182, p.91-98

2015

Volltextzugriff (PDF)

ON THE COMPLEXITY OF FINDING A SUN IN A GRAPH

SIAM journal on discrete mathematics, 2010-01, Vol.23 (4), p.2156-2162

HOANG, Chính T

2010

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Eating healthier: Exploring nutrition information for healthier recipe recommendation

Dichotomizing k-vertex-critical H-free graphs for H of order four

On the structure of (banner, odd hole)‐free graphs

On the structure of (pan, even hole)‐free graphs

On color-critical (P5,co-P5)-free graphs

Chromatic symmetric functions and H-free graphs

A refinement on the structure of vertex-critical (P5, gem)-free graphs

On clique separators, nearly chordal graphs, and the Maximum Weight Stable Set Problem

Finding and listing induced paths and cycles

The Intersection of Two Vertex Coloring Problems

A class of graphs with large rankwidth

A Closure Lemma for tough graphs and Hamiltonian degree conditions

On the Structure of (Even Hole, Kite)-Free Graphs

Vertex-critical ( P 3 + ℓ P 1 ) -free and vertex-critical (gem, co-gem)-free graphs

A Characterization of b-Perfect Graphs

Maximum Induced Matchings for Chordal Graphs in Linear Time

On coloring a class of claw-free and hole-twin-free graphs

On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two

Classes of Graphs with $e$-Positive Chromatic Symmetric Function

Edge intersection graphs of L-shaped paths in grids

Solving the clique cover problem on (bull, C4)-free graphs

Characterizing directed path graphs by forbidden asteroids

On the Structure of Graphs Without Claw, 4K1 and co-R

Constructions of -critical -free graphs

ON THE COMPLEXITY OF FINDING A SUN IN A GRAPH

Suchergebnisse filtern