X
Search Filters
Format Format
Subjects Subjects
Subjects Subjects
X
Sort by Item Count (A-Z)
Filter by Count
t-join (19) 19
mathematics (16) 16
t-joins (16) 16
mathematics, applied (14) 14
graphs (9) 9
algorithms (7) 7
matching (7) 7
operations research & management science (6) 6
approximation algorithms (4) 4
computer science (4) 4
graph theory (4) 4
matchings (4) 4
perfect matching (4) 4
traveling salesman problem (4) 4
algorithm (3) 3
approximation algorithm (3) 3
cardinality (3) 3
combinatorial optimization (3) 3
computer science, software engineering (3) 3
computer science, theory & methods (3) 3
mathematics of computing (3) 3
t-cuts (3) 3
[formula omitted]-join (2) 2
[formula omitted]-joins (2) 2
algorithm analysis and problem complexity (2) 2
apexes (2) 2
b-matching (2) 2
chinese postman problem (2) 2
combinatorics (2) 2
computer systems organization and communication networks (2) 2
cuts (2) 2
data structures, cryptology and information theory (2) 2
decomposition (2) 2
discrete mathematics and combinatorics (2) 2
factor-criticality (2) 2
graph block (2) 2
lp rounding (2) 2
management science (2) 2
matching theory (2) 2
metric space (2) 2
odd cuts (2) 2
odd edge-coloring (2) 2
odd edge-covering (2) 2
optimization (2) 2
packing of t-cuts (2) 2
paths (2) 2
planar graphs (2) 2
postman sets (2) 2
primal-dual method (2) 2
prize-collecting problems (2) 2
s,t-path tsp (2) 2
studies (2) 2
t -joins (2) 2
t-cut (2) 2
theoretical computer science (2) 2
theory of computation (2) 2
t‐join (2) 2
05c05 (1) 1
05c70 (1) 1
05c76 (1) 1
68q25 (1) 1
68r05 (1) 1
90c27 (1) 1
90c59 (1) 1
a-covering join (1) 1
algorithm design and analysis (1) 1
algorithmic proof (1) 1
all pairs shortest path (1) 1
analysis (1) 1
a‐covering join (1) 1
b -matching (1) 1
b$$ b -matching (1) 1
blossom (1) 1
bottleneck problem (1) 1
calculus of variations and optimal control; optimization (1) 1
chinese postman (1) 1
christofides' heuristic (1) 1
combinatorial analysis (1) 1
combinatorial search (1) 1
compact systems (1) 1
computation (1) 1
computational theory and mathematics (1) 1
conjecture (1) 1
conservative function (1) 1
conservative graph (1) 1
conservative weighting (1) 1
contraction (1) 1
convex and discrete geometry (1) 1
convex combination (1) 1
coordinate systems (1) 1
cost function (1) 1
degree-constrained subgraph (1) 1
directed hypergraph (1) 1
disjoint spanning-trees (1) 1
dominant (1) 1
edge-coloring (1) 1
edge-disjoint paths (1) 1
efficient implementation (1) 1
erdos-posa property (1) 1
erdo′′s-pósa property (1) 1
more...
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, 11/2019, Volume 92, Issue 3, pp. 304 - 321
An odd graph is a graph whose vertex degrees are all odd. As introduced by Pyber in 1991, an odd edge‐covering of graph G is a family of odd subgraphs that... 
odd edge‐coloring | odd subgraph | T‐join | odd edge‐covering | T-join | MATHEMATICS | odd edge-covering | odd edge-coloring
Journal Article
by Joo, A
ELECTRONIC JOURNAL OF COMBINATORICS, ISSN 1077-8926, 07/2017, Volume 24, Issue 3
We characterize the class of infinite connected graphs G for which there exists a T-join for any choice of an infinite T subset of V(G). We also show that the... 
T-join | MATHEMATICS | infinite graph | MATHEMATICS, APPLIED
Journal Article
Journal Article
Discrete Mathematics, ISSN 0012-365X, 03/2018, Volume 341, Issue 3, pp. 606 - 626
Motivated by a relaxed notion of the celebrated Hamiltonian cycle, this paper investigates its variant, parity Hamiltonian cycle (PHC): A PHC of a graph is a... 
[formula omitted]-join | Graph factor | Hamiltonian cycle problem | T-join | MATHEMATICS | COMBINATORIAL OPTIMIZATION | DISJOINT SPANNING-TREES | GRAPHS
Journal Article
Discrete Mathematics, ISSN 0012-365X, 02/2016, Volume 339, Issue 2, pp. 547 - 559
A connected undirected graph G is a Seymour graph if the maximum number of edge disjoint T-cuts is equal to the cardinality of a minimum T-join for every even... 
Seymour graph | [formula omitted]-join | Join covered graph | Conservative function | Matching covered graph | T-join | MATHEMATICS
Journal Article
ACM Transactions on Algorithms (TALG), ISSN 1549-6325, 07/2018, Volume 14, Issue 3, pp. 1 - 80
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2013, Volume 7801, pp. 362 - 374
Conference Proceeding
Ars Mathematica Contemporanea, ISSN 1855-3966, 2016, Volume 10, Issue 2, pp. 359 - 370
An edge-coloring of a graph G is said to be odd if for each vertex v of G and each color c, the vertex v either uses the color c an odd number of times or does... 
T-join | Subcubic graph | Odd chromatic index | Odd edge-covering | Odd edge-coloring | MATHEMATICS | MATHEMATICS, APPLIED | odd edge-coloring | odd chromatic index | odd edge-covering
Journal Article
Discrete Mathematics, Algorithms and Applications, ISSN 1793-8309, 12/2017, Volume 9, Issue 6
Journal Article
Journal of Combinatorial Theory, Series B, ISSN 0095-8956, 01/2016, Volume 116, pp. 287 - 305
Let G be a plane graph and T an even subset of its vertices. It has been conjectured that if all T-cuts of G have the same parity and the size of every T-cut... 
Edge-coloring | Planar graphs | T-joins | MATHEMATICS | Computer science
Journal Article
Mathematics of Operations Research, ISSN 0364-765X, 05/2004, Volume 29, Issue 2, pp. 383 - 393
Journal Article
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), ISSN 0302-9743, 2016, Volume 9849, pp. 50 - 58
Conference Proceeding
Journal of Graph Theory, ISSN 0364-9024, 09/2007, Volume 56, Issue 1, pp. 64 - 71
In an earlier paper 3, we studied cycles in graphs that intersect all edge‐cuts of prescribed sizes. Passing to a more general setting, we examine the... 
contraction | graft | small edge‐cut | T‐join | A‐covering join | T-join | A-covering join | Graft | Contraction | Small edge-cut | MATHEMATICS | small edge-cut
Journal Article
International Journal of Computer Mathematics, ISSN 0020-7160, 09/2011, Volume 88, Issue 13, pp. 2685 - 2696
Strong product G 1 ⊠ G 2 of two graphs G 1 and G 2 has a vertex set V(G 1 )×V(G 2 ) and two vertices (u 1 , v 1 ) and (u 2 , v 2 ) are adjacent whenever u 1 =u... 
T-join | 05C76 | strong product | factor-criticality | perfect matching | 05C70 | product graph | MATHEMATICS, APPLIED | L-EXTENDIBLE GRAPH | Graphs | Mathematical models
Journal Article
SIAM Journal on Discrete Mathematics, ISSN 0895-4801, 2012, Volume 26, Issue 3, pp. 884 - 895
Let nu(G) be the maximum number of vertex-disjoint odd cycles of a graph G and tau(G) the minimum number of vertices whose removal makes G bipartite. We show... 
Odd cycle transversals | Erdo″s-Pósa property | Planar graphs | T-joins | MATHEMATICS, APPLIED | planar graphs | odd cycle transversals | Erdos-Posa property | TRIANGLES | CONJECTURE
Journal Article
Computational Optimization and Applications, ISSN 0926-6003, 1/2012, Volume 51, Issue 1, pp. 323 - 344
Journal Article
Operations Research Letters, ISSN 0167-6377, 07/2013, Volume 41, Issue 4, pp. 321 - 324
Given an undirected graph with nonnegative edge weights, the max–min weighted T-join problem is to find an even cardinality vertex subset T such that the... 
Max–min optimization | Bottleneck problem | [formula omitted]-joins | Max-min optimization | T-joins | OPERATIONS RESEARCH & MANAGEMENT SCIENCE | SUBMODULAR SET FUNCTIONS | OPTIMIZATION | Algorithms
Journal Article
Bulletin of the Malaysian Mathematical Sciences Society, ISSN 0126-6705, 2010, Volume 33, Issue 2, pp. 197 - 204
Lexicographic product G o H of two graphs G and H has vertex set V(G) x V(H) and two vertices (u(1), v(1)) and (u(2), v(2)) are adjacent whenever u(1)u(2) is... 
Lexicographic product | T-join | Factor-criticality | Perfect matching | Extendable graph | MATHEMATICS | perfect matching | extendable graph | factor-criticality
Journal Article
No results were found for your search.

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