Result 1 to 20 of 158 total
4-coloring $H$-free graphs when $H$ is small. (English)
Discrete Appl. Math. 161, No. 1-2, 140-150 (2013).
1
Contractible edges in some $k$-connected graphs. (English)
Czech. Math. J. 62, No. 3, 637-644 (2012).
2
Graphs with complete minimal $k$-vertex separators. (English)
Ars Comb. 103, 225-232 (2012).
3
The minimal limit point of the third largest Laplacian eigenvalues of graphs. (English)
Ars Comb. 103, 119-127 (2012).
4
Exploiting a hypergraph model for finding golomb rulers. (English)
Mahjoub, A. Ridha (ed.) et al., Combinatorial optimization. Second international symposium, ISCO 2012, Athens, Greece, April 19-21, 2012. Revised selected papers. Berlin: Springer (ISBN 978-3-642-32146-7/pbk). Lecture Notes in Computer Science 7422, 368-379 (2012).
5
On the spectral radii of graphs without given cycles. (English)
Electron. J. Linear Algebra 23, 599-606, electronic only (2012).
6
The $A_4$-structure of a graph. (English)
J. Graph Theory 71, No. 2, 159-175 (2012).
7
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. (English)
Discrete Math. 312, No. 18, 2800-2818 (2012).
8
Distance domination versus iterated domination. (English)
Discrete Math. 312, No. 17, 2672-2675 (2012).
9
Determining the chromatic number of triangle-free $2P_3$-free graphs in polynomial time. (English)
Theor. Comput. Sci. 423, 1-10 (2012).
10
Upper bounds on Roman domination numbers of graphs. (English)
Discrete Math. 312, No. 7, 1386-1391 (2012).
11
Updating the complexity status of coloring graphs without a fixed induced linear forest. (English)
Theor. Comput. Sci. 414, No. 1, 9-19 (2012).
12
Graph-based data clustering with overlaps. (English)
Discrete Optim. 8, No. 1, 2-17 (2011).
13
Forbidden induced subgraphs for star-free graphs. (English)
Discrete Math. 311, No. 21, 2475-2484 (2011).
14
Editing graphs into disjoint unions of dense clusters. (English)
Algorithmica 61, No. 4, 949-970 (2011).
15
Subgraphs of weakly quasi-random oriented graphs. (English)
SIAM J. Discrete Math. 25, No. 1, 234-259 (2011).
16
On graphs and algebraic graphs that do not contain cycles of length 4. (English)
J. Graph Theory 68, No. 2, 91-102 (2011).
17
The complexity of dissociation set problems in graphs. (English)
Discrete Appl. Math. 159, No. 13, 1352-1366 (2011).
18
Forbidden triples for perfect matchings. (English)
J. Graph Theory 67, No. 3, 250-259 (2011).
19
Domination by union of complete graphs. (English)
Ars Comb. 95, 33-43 (2010).
20
Result 1 to 20 of 158 total
Start
Contact
Print
General Help
