UB Paderborn / Katalog / Suche / in CDI

Sortiert nach

Einfacher Volltextzugriff von (fast) überall

Installieren Sie die LibKey Nomad-Browsererweiterung und erhalten Sie von vielen Webseiten einfachen Zugriff auf lizenzierte Volltexte oder Open Access Publikationen. Mehr erfahren...

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)

Graph 2-rankings

Graphs and combinatorics, 2019-01, Vol.35 (1), p.91-102

2019

Volltextzugriff (PDF)

The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number

Graphs and combinatorics, 2024-02, Vol.40 (1), Article 18

2024

Volltextzugriff (PDF)

Completely Independent Spanning Trees in Line Graphs

Graphs and combinatorics, 2023-10, Vol.39 (5), Article 90

Hasunuma, Toru

2023

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)

Optimal Domination Polynomials

Graphs and combinatorics, 2020-09, Vol.36 (5), p.1477-1487

2020

Volltextzugriff (PDF)

On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs

Graphs and combinatorics, 2021-11, Vol.37 (6), p.2287-2304

2021

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)

Extensions of the Art Gallery Theorem

Annals of combinatorics, 2023-03, Vol.27 (1), p.31-50

2023

Volltextzugriff (PDF)

Independent Sets in (P4+P4,Triangle)-Free Graphs

Graphs and combinatorics, 2021-11, Vol.37 (6), p.2173-2189

Mosca, Raffaele

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)

Trees with Unique Minimum Semitotal Dominating Sets

Graphs and combinatorics, 2020-05, Vol.36 (3), p.689-702

2020

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)

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)

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)

The Signature of Chordal Graphs and Cographs

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

2021

Volltextzugriff (PDF)

Super Graphs on Groups, I

Graphs and combinatorics, 2022-06, Vol.38 (3), Article 100

2022

Volltextzugriff (PDF)

Long Cycles Passing Through a Linear Forest

Graphs and combinatorics, 2020-05, Vol.36 (3), p.639-664

2020

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)

Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs

Graphs and combinatorics, 2021, Vol.37 (1), p.65-85

2021

Volltextzugriff (PDF)

On the Number of Forests and Connected Spanning Subgraphs

Graphs and combinatorics, 2021-11, Vol.37 (6), p.2655-2678

2021

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)

Upper Total Domination in Claw-Free Cubic Graphs

Graphs and combinatorics, 2022-12, Vol.38 (6), Article 172

2022

Volltextzugriff (PDF)

On Specific Factors in Graphs

Graphs and combinatorics, 2020-09, Vol.36 (5), p.1391-1399

2020

Volltextzugriff (PDF)

1 – 25 von 132

Menü

Weitere Dienste

Einstellungen

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

Graph 2-rankings

The Oriented Diameter of Graphs with Given Connected Domination Number and Distance Domination Number

Completely Independent Spanning Trees in Line Graphs

Grad and classes with bounded expansion I. Decompositions

Optimal Domination Polynomials

On the Maximal Colorings of Complete Graphs Without Some Small Properly Colored Subgraphs

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

Matching Numbers and Dimension of Edge Ideals

Extensions of the Art Gallery Theorem

Independent Sets in (P4+P4,Triangle)-Free Graphs

Half-Arc-Transitive Graphs and the Fano Plane

Trees with Unique Minimum Semitotal Dominating Sets

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

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

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

The Signature of Chordal Graphs and Cographs

Super Graphs on Groups, I

Long Cycles Passing Through a Linear Forest

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

Strongly Spanning Trailable Graphs with Small Circumference and Hamilton-Connected Claw-Free Graphs

On the Number of Forests and Connected Spanning Subgraphs

Contractible Edges and Contractible Triangles in a 3-Connected Graph

Upper Total Domination in Claw-Free Cubic Graphs

On Specific Factors in Graphs

Aktive Filter

Suchergebnisse filtern