X
Search Filters
Format Format
Format Format
X
Sort by Item Count (A-Z)
Filter by Count
Journal Article (105) 105
Publication (22) 22
Book Chapter (2) 2
Book / eBook (1) 1
Book Review (1) 1
Compact Disc (1) 1
Conference Proceeding (1) 1
Dissertation (1) 1
Video Recording (1) 1
Web Resource (1) 1
more...
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
mathematics - combinatorics (49) 49
computer science (36) 36
mathematics (35) 35
discrete mathematics (32) 32
algorithms (22) 22
computer science - discrete mathematics (20) 20
[ info.info-dm ] computer science [cs]/discrete mathematics [cs.dm] (18) 18
combinatorics (16) 16
coloring (14) 14
algorithm (13) 13
graphs (12) 12
decomposition (10) 10
induced subgraph (9) 9
mathematics, applied (9) 9
berge graphs (8) 8
theoretical computer science (8) 8
discrete mathematics and combinatorics (7) 7
perfect graph (7) 7
perfect graphs (7) 7
2-join (6) 6
[info.info-dm]computer science [cs]/discrete mathematics [cs.dm] (6) 6
computational theory and mathematics (6) 6
graph theory (6) 6
[ math.math-co ] mathematics [math]/combinatorics [math.co] (5) 5
connectivity (5) 5
detection (5) 5
graph (5) 5
berge graph (4) 4
even pair (4) 4
mathematical analysis (4) 4
np-completeness (4) 4
recognition (4) 4
theorem (4) 4
05c75 (3) 3
05c85 (3) 3
applied mathematics (3) 3
chi-bounded (3) 3
chromatic number (3) 3
hole-free graphs (3) 3
induced subgraphs (3) 3
recognition algorithm (3) 3
series-parallel graphs (3) 3
star decomposition (3) 3
star-cutsets (3) 3
structure theorem (3) 3
theorems (3) 3
trees (3) 3
truemper configurations (3) 3
wheel (3) 3
[info]computer science [cs] (2) 2
[math.math-co]mathematics [math]/combinatorics [math.co] (2) 2
[math]mathematics [math] (2) 2
acm : g.: mathematics of computing/g.2: discrete mathematics (2) 2
algorithm analysis and problem complexity (2) 2
amalgam (2) 2
balanced skew partition (2) 2
chords (2) 2
claw-free (2) 2
clique (2) 2
clique of maximum weight (2) 2
colouring (2) 2
complexity (2) 2
computer science, software engineering (2) 2
computer science, theory & methods (2) 2
computer systems organization and communication networks (2) 2
data structures and algorithms (2) 2
data structures, cryptology and information theory (2) 2
detecting (2) 2
digraphs (2) 2
even (2) 2
free perfect graphs (2) 2
graph operations (2) 2
homogeneous set (2) 2
imperfect graphs (2) 2
induced (2) 2
induced paths and cycles (2) 2
integers (2) 2
jazz (2) 2
large chromatic number (2) 2
linkings (2) 2
mathematics - history and overview (2) 2
mathematics of computing (2) 2
matroids (2) 2
planar graphs (2) 2
polynomials (2) 2
proving (2) 2
skew partition (2) 2
stable set (2) 2
structure (2) 2
subgraphs (2) 2
substitution (2) 2
theory of computation (2) 2
theta (2) 2
three-in-a-tree (2) 2
tree (2) 2
truemper configuration (2) 2
unimodular matrices (2) 2
χ-bounded (2) 2
05c05 (1) 1
05c15 (1) 1
more...
Library Location Library Location
Language Language
Publication Date Publication Date
Click on a bar to filter by decade
Slide to change publication date range


Journal of Graph Theory, ISSN 0364-9024, 04/2017, Volume 84, Issue 4, pp. 536 - 551
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 03/2017, Volume 84, Issue 3, pp. 233 - 248
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 06/2018, Volume 88, Issue 2, pp. 312 - 336
A long unichord in a graph is an edge that is the unique chord of some cycle of length at least 5. A graph is long unichord free if it does not contain any... 
05C75 | χ‐bounded | amalgam | chords | 05C85 | 05C15 | χ-bounded | Computer Science | Discrete Mathematics
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 2008, Volume 98, Issue 1, pp. 173 - 225
A hole in a graph is an induced cycle on at least four vertices. A graph is Berge if it has no odd hole and if its complement has no odd hole. In 2002,... 
Balanced skew partition | Berge graph | 2-Join | Decomposition | Detection | Perfect graph | Recognition | PERFECT GRAPHS | MATHEMATICS | detection | STAR-CUTSETS | ALGORITHM | recognition | decomposition | 2-join | perfect graph | balanced skew partition | HOLE-FREE GRAPHS | Algorithms | Mathematics - Combinatorics | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 08/2019
Journal Article
Graphs and Combinatorics, ISSN 0911-0119, 11/2009, Volume 25, Issue 4, pp. 489 - 502
The three-in-a-tree algorithm of Chudnovsky and Seymour decides in time O(n 4) whether three given vertices of a graph belong to an induced tree. Here, we... 
05C75 | 05C85 | Mathematics | Engineering Design | Four-in-a-tree | Algorithm | Three-in-a-tree | Induced subgraph | Triangle-free graphs | 90C35 | Tree | Combinatorics | 68R10 | 05C05 | MATHEMATICS | Algorithms | Graphs | Computer Science | Discrete Mathematics
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 07/2019
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2005, Volume 19, Issue 3, pp. 553 - 574
We consider the class A of graphs that contain no odd hole, no antihole of length at least 5, and no prism ( a graph consisting of two disjoint triangles with... 
Perfectly contractile | Even pair | Perfect graph | Recognition algorithm | recognition algorithm | MATHEMATICS, APPLIED | perfectly contractile | even pair | perfect graph | Mathematics | Combinatorics | Computer Science | Discrete Mathematics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 04/2017, Volume 84, Issue 4, pp. 536 - 551
Equistable graphs are graphs admitting positive weights on vertices such that a subset of vertices is a maximal stable set if and only if it is of total... 
05C76 | conjecture | 05C22 | 05C50 | 05C69 | equistable graph; strongly equistable graph; general partition graph; line graph; graph complement | MATHEMATICS | strongly equistable graph | graph complement | general partition graph | PARTITION GRAPHS | line graph | equistable graph | Computer Science | Discrete Mathematics
Journal Article
Algorithmica, ISSN 0178-4617, 02/2018, Volume 80, Issue 2, pp. 415 - 447
Journal Article
Algorithmica, ISSN 0178-4617, 2/2018, Volume 80, Issue 2, pp. 415 - 447
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 03/2017, Volume 84, Issue 3, pp. 233 - 248
We prove a decomposition theorem for the class of triangle‐free graphs that do not contain a subdivision of the complete graph on four vertices as an induced... 
decompostion | 05C75 | induced subdivision of K4 | coloring | MATHEMATICS | Computer Science | Discrete Mathematics
Journal Article
Journal of Combinatorial Theory. Series B, ISSN 0095-8956, 2018
Truemper configurations are four types of graphs (namely thetas, wheels, prisms and pyramids) that play an important role in the proof of several decomposition... 
Structure theorem | 2-Join | Decomposition | Induced subgraph | Recognition algorithm | Clique cutset | Truemper configuration
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 10/2019, Volume 92, Issue 2, pp. 67 - 95
We show that triangle‐free graphs that do not contain an induced subgraph isomorphic to a subdivision of K 4 are 3‐colorable. This proves a conjecture of... 
induced subgraph | coloring
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 08/2017, Volume 85, Issue 4, pp. 814 - 838
A graph G has maximal local edge‐connectivity k if the maximum number of edge‐disjoint paths between every pair of distinct vertices x and y is at most k. We... 
local connectivity | coloring | vertex degree | minimally k‐connected | Brooks’ theorem | local edge‐connectivity | local edge-connectivity | minimally k-connected | MATHEMATICS | Brooks' theorem | Computer Science | Discrete Mathematics
Journal Article
Journal of Graph Theory, ISSN 0364-9024, 01/2010, Volume 63, Issue 1, pp. 31 - 67
We give a structural description of the class 𝒞 of graphs that do not contain a cycle with a unique chord as an induced subgraph. Our main theorem states that... 
detection | Petersen graph | cycle with a unique chord | recognition | decomposition | coloring | Heawood graph | structure | Coloring | Decomposition | Cycle with a unique chord | Detection | Structure | Recognition | MATHEMATICS | UNIMODULAR MATRICES | ALGORITHMS | BERGE GRAPHS | Mathematics - Combinatorics | Computer Science | Discrete Mathematics
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2012, Volume 26, Issue 4, pp. 1510 - 1531
We recall several known results about minimally 2-connected graphs and show that they all follow from a decomposition theorem. Starting from an analogy with... 
Connectivity | Propeller | Wheels | Induced subgraph | wheels | MATHEMATICS, APPLIED | connectivity | propeller | induced subgraph | THEOREM | ALGORITHMS
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2008, Volume 22, Issue 1, pp. 51 - 71
Journal Article
09/2013
M. Chudnovsky, P. Seymour and N. Trotignon. Detecting an induced net subdivision. Journal of Combinatorial Theory, Series B, 103(5):630-641, 2013 A {\em net}... 
Journal Article
No results were found for your search.

Cannot display more than 1000 results, please narrow the terms of your search.