Works matching IS 12343099 AND DT 2007 AND VI 27 AND IP 3
Results: 19
A SOKOBAN-TYPE GAME AND ARC DELETION WITHIN IRREGULAR DIGRAPHS OF ALL SIZES.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 611
- By:
- Publication type:
- Article
MINIMAL NON-SELFCENTRIC RADIALLY-MAXIMAL GRAPHS OF RADIUS 4.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 603, doi. 10.7151/dmgt.1386
- By:
- Publication type:
- Article
FACTORING DIRECTED GRAPHS WITH RESPECT TO THE CARDINAL PRODUCT IN POLYNOMIAL TIME.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 593, doi. 10.7151/dmgt.1385
- By:
- Publication type:
- Article
MAGIC AND SUPERMAGIC DENSE BIPARTITE GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 583, doi. 10.7151/dmgt.1384
- By:
- Publication type:
- Article
THE REPRESENTATION OF MULTI-HYPERGRAPHS BY SET INTERSECTIONS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 565, doi. 10.7151/dmgt.1383
- By:
- Publication type:
- Article
'3in1' ENHANCED: THREE SQUARED WAYS TO '3in1' GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 561
- By:
- Publication type:
- Article
PREFACE TO PROCEEDINGS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 559, doi. 10.7151/dmgt.1381
- By:
- Publication type:
- Article
AN APPROXIMATION ALGORITHM FOR THE TOTAL COVERING PROBLEM.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 553, doi. 10.7151/dmgt.1380
- By:
- Publication type:
- Article
A PROOF OF THE CROSSING NUMBER OF K<sub>3;n</sub> IN A SURFACE.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 549, doi. 10.7151/dmgt.1379
- By:
- Publication type:
- Article
FRACTIONAL DOMINATION IN PRISMS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 541, doi. 10.7151/dmgt.1378
- By:
- Publication type:
- Article
COUNTEREXAMPLE TO A CONJECTURE ON THE STRUCTURE OF BIPARTITE PARTITIONABLE GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 527, doi. 10.7151/dmgt.1377
- By:
- Publication type:
- Article
THE STRUCTURE AND EXISTENCE OF 2-FACTORS IN ITERATED LINE GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 507, doi. 10.7151/dmgt.1376
- By:
- Publication type:
- Article
DISTANCE DEFINED BY SPANNING TREES IN GRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 485, doi. 10.7151/dmgt.1375
- By:
- Publication type:
- Article
TOWARDS A CHARACTERIZATION OF BIPARTITE SWITCHING CLASSES BY MEANS OF FORBIDDEN SUBGRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 471, doi. 10.7151/dmgt.1374
- By:
- Publication type:
- Article
ON (k; l)-KERNELS IN D-JOIN OF DIGRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 457, doi. 10.7151/dmgt.1373
- By:
- Publication type:
- Article
SOME TOTALLY 4-CHOOSABLE MULTIGRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 425, doi. 10.7151/dmgt.1372
- By:
- Publication type:
- Article
EFFICIENT (j; k)-DOMINATION.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 409, doi. 10.7151/dmgt.1371
- By:
- Publication type:
- Article
THE CHVÁTAL-ERDŐS CONDITION AND 2-FACTORS WITH A SPECIFIED NUMBER OF COMPONENTS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 401, doi. 10.7151/dmgt.1370
- By:
- Publication type:
- Article
MONOCHROMATIC KERNEL-PERFECTNESS OF SPECIAL CLASSES OF DIGRAPHS.
- Published in:
- Discussiones Mathematicae: Graph Theory, 2007, v. 27, n. 3, p. 389, doi. 10.7151/dmgt.1369
- By:
- Publication type:
- Article