default search action
Marc J. Lipman
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [j26]Landan Hicks, Marc J. Lipman, Matt Walsh:
A colour-sliding problem on graphs. Australas. J Comb. 58: 320-332 (2014) - 2012
- [j25]Eddie Cheng
, Marc J. Lipman, László Lipták:
Matching preclusion and conditional matching preclusion for regular interconnection networks. Discret. Appl. Math. 160(13-14): 1936-1954 (2012) - 2011
- [j24]Eddie Cheng
Conditional matching preclusion for the alternating group graphs and split-stars. Int. J. Comput. Math. 88(6): 1120-1136 (2011) - [j23]Eddie Cheng
Conditional matching preclusion for the arrangement graphs. Theor. Comput. Sci. 412(45): 6279-6289 (2011)
2000 – 2009
- 2009
- [j22]Eddie Cheng
Conditional matching preclusion sets. Inf. Sci. 179(8): 1092-1101 (2009) - 2008
- [j21]Eddie Cheng
Strong structural properties of unidirectional star graphs. Discret. Appl. Math. 156(15): 2939-2949 (2008) - [j20]Eddie Cheng
Matching preclusion for Alternating Group Graphs and their Generalizations. Int. J. Found. Comput. Sci. 19(6): 1413-1437 (2008) - [j19]Eddie Cheng
Hamiltonian connectivity of 2-tree-generated networks. Math. Comput. Model. 48(5-6): 787-804 (2008) - 2003
- [j18]Eddie Cheng
Time-stamped Graphs and Their Associated Influence Digraphs. Discret. Appl. Math. 128(2-3): 317-335 (2003) - 2002
- [j17]Eddie Cheng
Vulnerability issues of star graphs, alternating group graphs and split-stars: strength and toughness. Discret. Appl. Math. 118(3): 163-179 (2002) - [j16]Eddie Cheng
Influence Digraphs Induced by Time-Stamped Graphs (Extended Abstract). Electron. Notes Discret. Math. 11: 128-139 (2002) - [j15]Eddie Cheng
Basic Structures of Some Interconnection Networks. Electron. Notes Discret. Math. 11: 140-156 (2002) - [j14]Eddie Cheng, Marc J. Lipman:
Unidirectional (n, k)-Star Graphs. J. Interconnect. Networks 3(1-2): 19-34 (2002) - [j13]Eddie Cheng
Increasing the connectivity of the star graphs. Networks 40(3): 165-169 (2002) - [c5]Eddie Cheng, Serge G. Kruk, Marc J. Lipman:
Flow Formulations for the Student Scheduling Problem. PATAT 2002: 299-309 - 2001
- [j12]Eddie Cheng, Marc J. Lipman, Hyungju Park:
Super Connectivity of Star Graphs, Alternating Group Graphs and Split-Stars. Ars Comb. 59 (2001) - 2000
- [j11]Eddie Cheng
On the Day-Tripathi orientation of the star graphs: Connectivity. Inf. Process. Lett. 73(1-2): 5-10 (2000) - [j10]Eddie Cheng, Marc J. Lipman:
Orienting split-stars and alternating group graphs. Networks 35(2): 139-144 (2000)
1990 – 1999
- 1997
- [j9]Lowell W. Beineke, Wayne Goddard, Marc J. Lipman:
Graphs with Maximum Edge-Integrity. Ars Comb. 46 (1997) - 1995
- [j8]Marc J. Lipman, Julia Abrahams:
Minimum average cost testing for partially ordered components. IEEE Trans. Inf. Theory 41(1): 287-291 (1995) - 1994
- [j7]Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
Edge-integrity: a survey. Discret. Math. 124(1-3): 3-12 (1994) - 1993
- [j6]Kunwarjit S. Bagga, Lowell W. Beineke, Marc J. Lipman, Raymond E. Pippert:
On the honesty of graph complements. Discret. Math. 122(1-3): 1-6 (1993) - [j5]Julia Abrahams, Marc J. Lipman:
Relative uniformity of sources and the comparison of optimal code costs. IEEE Trans. Inf. Theory 39(5): 1695-1697 (1993) - 1992
- [j4]Kunwarjit S. Bagga, Lowell W. Beineke, Wayne Goddard, Marc J. Lipman, Raymond E. Pippert:
A Survey of Integrity. Discret. Appl. Math. 37/38: 13-28 (1992) - [j3]Julia Abrahams, Marc J. Lipman:
Zero-redundancy coding for unequal code symbol costs. IEEE Trans. Inf. Theory 38(5): 1583-1586 (1992)
1980 – 1989
- 1987
- [c4]Robert L. Sedlmeyer, Marc J. Lipman:
Property computation in Grapple (abstract only). ACM Conference on Computer Science 1987: 366 - [c3]Marc J. Lipman, Robert L. Sedlmeyer:
Knowledge and reasoning in graph theory research (abstract only). ACM Conference on Computer Science 1987: 415 - 1986
- [c2]Marc J. Lipman, Robert L. Sedlmeyer:
Developments in an expert system for graph theory investigation. ACM Conference on Computer Science 1986: 327-330 - 1985
- [j2]Marc J. Lipman:
Hamiltonian cycles and paths in vertex-transitive graphs with abelian and nilpotent groups. Discret. Math. 54(1): 15-21 (1985) - [c1]Robert L. Sedlmeyer, Marc J. Lipman:
Computer-aided investigation in graph theory (abstract only). ACM Conference on Computer Science 1985: 418 - 1983
- [j1]Richard D. Ringeisen, Marc J. Lipman:
Cohesion and stability in graphs. Discret. Math. 46(2): 191-198 (1983)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-25 05:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: