Marc J. Lipman

Matt Walsh

Australas. J Comb., 2014

2012

Matching preclusion and conditional matching preclusion for regular interconnection networks.

[BibT_eX]

[DOI]

László Lipták

Discret. Appl. Math., 2012

2011

Conditional matching preclusion for the arrangement graphs.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2011

Conditional matching preclusion for the alternating group graphs and split-stars.

[BibT_eX]

[DOI]

László Lipták

Matthew Toeniskoetter

Int. J. Comput. Math., 2011

2009

Conditional matching preclusion sets.

[BibT_eX]

[DOI]

Inf. Sci., 2009

2008

Hamiltonian connectivity of 2-tree-generated networks.

[BibT_eX]

[DOI]

Math. Comput. Model., 2008

Matching preclusion for Alternating Group Graphs and their Generalizations.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2008

Strong structural properties of unidirectional star graphs.

[BibT_eX]

[DOI]

László Lipták

Discret. Appl. Math., 2008

2003

Time-stamped Graphs and Their Associated Influence Digraphs.

[BibT_eX]

[DOI]

Jerrold W. Grossman

Discret. Appl. Math., 2003

2002

Increasing the connectivity of the star graphs.

[BibT_eX]

[DOI]

Networks, 2002

Unidirectional <i>(n, k)</i>-Star Graphs.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2002

Basic Structures of Some Interconnection Networks.

[BibT_eX]

[DOI]

Electron. Notes Discret. Math., 2002

Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract).

[BibT_eX]

[DOI]

Jerrold W. Grossman

Electron. Notes Discret. Math., 2002

Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness.

[BibT_eX]

[DOI]

Discret. Appl. Math., 2002

Flow Formulations for the Student Scheduling Problem.

[BibT_eX]

[DOI]

Serge G. Kruk

Proceedings of the Practice and Theory of Automated Timetabling IV, 2002

2001

Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars.

[BibT_eX]

Hyungju Park

Ars Comb., 2001

2000

Orienting split-stars and alternating group graphs.

[BibT_eX]

[DOI]

Networks, 2000

On the Day-Tripathi orientation of the star graphs: Connectivity.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2000

1997

Graphs with Maximum Edge-Integrity.

[BibT_eX]

Lowell W. Beineke

Wayne Goddard

Ars Comb., 1997

1995

Minimum average cost testing for partially ordered components.

[BibT_eX]

[DOI]

Julia Abrahams

IEEE Trans. Inf. Theory, 1995

1994

Edge-integrity: a survey.

[BibT_eX]

[DOI]

Discret. Math., 1994

1993

Relative uniformity of sources and the comparison of optimal code costs.

[BibT_eX]

[DOI]

Julia Abrahams

IEEE Trans. Inf. Theory, 1993

On the honesty of graph complements.

[BibT_eX]

[DOI]

Discret. Math., 1993

1992

Zero-redundancy coding for unequal code symbol costs.

[BibT_eX]

[DOI]

Julia Abrahams

IEEE Trans. Inf. Theory, 1992

A Survey of Integrity.

[BibT_eX]

[DOI]

Discret. Appl. Math., 1992

1987

Property computation in Grapple (abstract only).

[BibT_eX]

[DOI]

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

Knowledge and reasoning in graph theory research (abstract only).

[BibT_eX]

[DOI]

Proceedings of the 15th ACM Annual Conference on Computer Science, 1987

1986

Developments in an expert system for graph theory investigation.

[BibT_eX]

[DOI]

Proceedings of the 14th ACM Annual Conference on Computer Science, 1986

1985

Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups.

[BibT_eX]

[DOI]

Discret. Math., 1985

Computer-aided investigation in graph theory (abstract only).

[BibT_eX]

[DOI]

Proceedings of the 13th ACM Annual Conference on Computer Science, 1985

1983

Cohesion and stability in graphs.

[BibT_eX]

[DOI]

Richard D. Ringeisen