Result 1 to 20 of 222 total
4-coloring $H$-free graphs when $H$ is small. (English)
Discrete Appl. Math. 161, No. 1-2, 140-150 (2013).
1
On a graph partition result of Kűhn and Osthus. (English)
Ars Comb. 103, 491-495 (2012).
2
Graphs with complete minimal $k$-vertex separators. (English)
Ars Comb. 103, 225-232 (2012).
3
Maximum regular induced subgraphs in $2P_3$-free graphs. (English)
Theor. Comput. Sci. 460, 26-33 (2012).
4
Constructing optimal subnetworks for the crossed cube network. (English)
Networks 60, No. 2, 86-93 (2012).
5
Polyhedral study of the maximum common induced subgraph problem. (English)
Ann. Oper. Res. 199, 77-102 (2012).
6
Maximum induced multicliques and complete multipartite subgraphs in polygon-circle graphs and circle graphs. (English)
Golumbic, Martin Charles (ed.) et al., Graph-theoretic concepts in computer science. 38th international workshop, WG 2012, Jerusalem, Israel, June 26‒28, 2012. Revised selcted papers. Berlin: Springer (ISBN 978-3-642-34610-1/pbk). Lecture Notes in Computer Science 7551, 297-307 (2012).
7
Pairs of forbidden induced subgraphs for homogeneously traceable graphs. (English)
Discrete Math. 312, No. 18, 2800-2818 (2012).
8
Algorithms for finding a maximum non-$k$-linked graph. (English)
SIAM J. Discrete Math. 26, No. 2, 591-604 (2012).
9
The graph $Δ_{2n - 1}$ is an induced subgraph of a Johnson graph. (English)
Int. J. Contemp. Math. Sci. 7, No. 5-8, 369-376 (2012).
10
Some results on induced subgraphs of Johnson graphs. (English)
Int. Math. Forum 7, No. 9-12, 445-454 (2012).
11
On graphs with no induced subdivision of $K_4$. (English)
J. Comb. Theory, Ser. B 102, No. 4, 924-947 (2012).
12
Distance domination versus iterated domination. (English)
Discrete Math. 312, No. 17, 2672-2675 (2012).
13
{\sc max-cut} and containment relations in graphs. (English)
Theor. Comput. Sci. 438, 89-95 (2012).
14
Solving VLSI design and DNA sequencing problems using bipartization of graphs. (English)
Comput. Optim. Appl. 51, No. 2, 749-781 (2012).
15
Edge contractions in subclasses of chordal graphs. (English)
Discrete Appl. Math. 160, No. 7-8, 999-1010 (2012).
16
Determining the chromatic number of triangle-free $2P_3$-free graphs in polynomial time. (English)
Theor. Comput. Sci. 423, 1-10 (2012).
17
Graphs of separability at most 2. (English)
Discrete Appl. Math. 160, No. 6, 685-696 (2012).
18
A linear time algorithm for the induced disjoint paths problem in planar graphs. (English)
J. Comput. Syst. Sci. 78, No. 2, 670-680 (2012).
19
The structure of bull-free graphs II and III ‒ a summary. (English)
J. Comb. Theory, Ser. B 102, No. 1, 252-282 (2012).
20
Result 1 to 20 of 222 total
Start
Contact
Print
General Help
