UB Paderborn / Katalog / Suche / in CDI

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles

Combinatorica (Budapest. 1981), 2020-11, Vol.40 (5), p.625-653

2020

Volltextzugriff (PDF)

Grad and classes with bounded expansion I. Decompositions

European journal of combinatorics, 2008-04, Vol.29 (3), p.760-776

2008

Volltextzugriff (PDF)

On spanning tree congestion of graphs

Discrete mathematics, 2009-07, Vol.309 (13), p.4215-4224

2009

Volltextzugriff (PDF)

On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results

Discrete mathematics, 2009-08, Vol.309 (16), p.5169-5182

Cheng, Christine T.

2009

Volltextzugriff (PDF)

The profile of the Cartesian product of graphs

Discrete Applied Mathematics, 2008-08, Vol.156 (15), p.2835-2845

2008

Volltextzugriff (PDF)

On probe permutation graphs

Discrete Applied Mathematics, 2009-06, Vol.157 (12), p.2611-2619

2009

Volltextzugriff (PDF)

Labeling graphs with two distance constraints

Discrete mathematics, 2008-12, Vol.308 (23), p.5645-5655

2008

Volltextzugriff (PDF)

Koszul Bipartite Graphs

Advances in applied mathematics, 1999-01, Vol.22 (1), p.25-28

1999

Volltextzugriff (PDF)

The Cardinality of the Collection of Maximum Independent Sets of a Functional Graph

Advances in applied mathematics, 1997-04, Vol.18 (3), p.286-299

1997

Volltextzugriff (PDF)

Even edge colorings of a graph

Journal of combinatorial theory. Series B, 1983-01, Vol.35 (1), p.78-79

Acharya, B. Devadas

1983

Volltextzugriff (PDF)

Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs

Graphs and combinatorics, 2021-03, Vol.37 (2), p.559-580

2021

Volltextzugriff (PDF)

Matching Numbers and Dimension of Edge Ideals

Graphs and combinatorics, 2021-05, Vol.37 (3), p.761-774

2021

Volltextzugriff (PDF)

A Principle for Converting Lindström-Type Lemmas to Stembridge-Type Theorems, with Applications to Walks, Groves, and Alternating Flows

Graphs and combinatorics, 2021-07, Vol.37 (4), p.1229-1246

Biesel, Owen

2021

Volltextzugriff (PDF)

Half-Arc-Transitive Graphs and the Fano Plane

Graphs and combinatorics, 2021-05, Vol.37 (3), p.987-1012

2021

Volltextzugriff (PDF)

Non-existence and Construction of Pre-difference Sets, and Equi-Distributed Subsets in Association Schemes

Graphs and combinatorics, 2021-09, Vol.37 (5), p.1531-1544

2021

Volltextzugriff (PDF)

On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs

Graphs and combinatorics, 2022-02, Vol.38 (1), Article 12

2022

Volltextzugriff (PDF)

The Signature of Chordal Graphs and Cographs

Graphs and combinatorics, 2021-03, Vol.37 (2), p.643-650

2021

Volltextzugriff (PDF)

The Odd Chromatic Number of a Planar Graph is at Most 8

Graphs and combinatorics, 2023-04, Vol.39 (2), Article 28

2023

Volltextzugriff (PDF)

The b-Continuity of Graphs with Large Girth

Graphs and combinatorics, 2017-09, Vol.33 (5), p.1139-1146

2017

Volltextzugriff (PDF)

The Average Size of Matchings in Graphs

Graphs and combinatorics, 2020-05, Vol.36 (3), p.539-560

2020

Volltextzugriff (PDF)

Contractible Edges and Contractible Triangles in a 3-Connected Graph

Graphs and combinatorics, 2021-09, Vol.37 (5), p.1807-1821

2021

Volltextzugriff (PDF)

Acyclic Edge Coloring of Chordal Graphs with Bounded Degree

Graphs and combinatorics, 2021, Vol.37 (6), p.2621-2636

2021

Volltextzugriff (PDF)

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path

Combinatorica (Budapest. 1981), 2023-10, Vol.43 (5), p.845-852

2023

Volltextzugriff (PDF)

Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs

Graphs and combinatorics, 2021-09, Vol.37 (5), p.1913-1921

2021

Volltextzugriff (PDF)

Rainbow Connection in Some Digraphs

Graphs and combinatorics, 2016-11, Vol.32 (6), p.2199-2209

2016

Volltextzugriff (PDF)

Menü

Weitere Dienste

Einstellungen

Degeneracy and Colorings of Squares of Planar Graphs without 4-Cycles

Grad and classes with bounded expansion I. Decompositions

On spanning tree congestion of graphs

On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results

The profile of the Cartesian product of graphs

On probe permutation graphs

Labeling graphs with two distance constraints

Koszul Bipartite Graphs

The Cardinality of the Collection of Maximum Independent Sets of a Functional Graph

Even edge colorings of a graph

Fractional Matchings, Component-Factors and Edge-Chromatic Critical Graphs

Matching Numbers and Dimension of Edge Ideals

A Principle for Converting Lindström-Type Lemmas to Stembridge-Type Theorems, with Applications to Walks, Groves, and Alternating Flows

Half-Arc-Transitive Graphs and the Fano Plane

Non-existence and Construction of Pre-difference Sets, and Equi-Distributed Subsets in Association Schemes

On the Number of Heterochromatic Trees in Nice and Beautiful Colorings of Complete Graphs

The Signature of Chordal Graphs and Cographs

The Odd Chromatic Number of a Planar Graph is at Most 8

The b-Continuity of Graphs with Large Girth

The Average Size of Matchings in Graphs

Contractible Edges and Contractible Triangles in a 3-Connected Graph

Acyclic Edge Coloring of Chordal Graphs with Bounded Degree

Polynomial Bounds for Chromatic Number. IV: A Near-polynomial Bound for Excluding the Five-vertex Path

Rainbow and Properly Colored Spanning Trees in Edge-Colored Bipartite Graphs

Rainbow Connection in Some Digraphs

Aktive Filter

Suchergebnisse filtern