Notice: Unexpected clearActionName after getActionName already called in /var/www/html/w/includes/context/RequestContext.php on line 333
Bert L. Hartnell - MaRDI portal

Bert L. Hartnell

From MaRDI portal
(Redirected from Person:400446)
Person:323040

Available identifiers

zbMath Open hartnell.bert-lWikidataQ102200599 ScholiaQ102200599MaRDI QIDQ323040

List of research outcomes





PublicationDate of PublicationType
A characterization of well-indumatchable graphs having girth greater than seven2022-09-15Paper
On graphs having one size of maximal open packings2021-10-15Paper
https://portal.mardi4nfdi.de/entity/Q49953242021-06-23Paper
A new framework to approach Vizing's conjecture2021-03-11Paper
On the structure of 4-regular planar well-covered graphs2020-06-29Paper
On well-covered Cartesian products2019-01-11Paper
Uniformly dissociated graphs2018-02-26Paper
On well-covered pentagonalizations of the plane2017-05-15Paper
Well-covered triangulations. IV2016-10-07Paper
https://portal.mardi4nfdi.de/entity/Q57409302016-07-20Paper
https://portal.mardi4nfdi.de/entity/Q28160852016-07-01Paper
https://portal.mardi4nfdi.de/entity/Q28782062014-08-28Paper
Independent protection in graphs2014-08-21Paper
Paired versus double domination in \(K_{1,r}\)-free graphs2014-06-24Paper
On graphs having maximal independent sets of exactly \(t\) distinct cardinalities2013-06-26Paper
https://portal.mardi4nfdi.de/entity/Q52989202013-06-25Paper
On the Cartesian product of non well-covered graphs2013-06-07Paper
https://portal.mardi4nfdi.de/entity/Q28953352012-07-02Paper
Vizing's conjecture: a survey and recent results2012-02-08Paper
https://portal.mardi4nfdi.de/entity/Q30156662011-07-13Paper
https://portal.mardi4nfdi.de/entity/Q30123872011-07-06Paper
Well paired-dominated graphs2010-10-26Paper
Limited packings in graphs2010-08-13Paper
https://portal.mardi4nfdi.de/entity/Q35677912010-06-17Paper
https://portal.mardi4nfdi.de/entity/Q35658682010-06-07Paper
On well-covered triangulations. III2010-05-25Paper
On well-covered triangulations. II.2010-04-28Paper
https://portal.mardi4nfdi.de/entity/Q36261732009-05-22Paper
https://portal.mardi4nfdi.de/entity/Q36159762009-03-24Paper
https://portal.mardi4nfdi.de/entity/Q35142932008-07-21Paper
Limited Packings in Graphs2008-06-05Paper
https://portal.mardi4nfdi.de/entity/Q54491732008-03-11Paper
https://portal.mardi4nfdi.de/entity/Q34247812007-03-05Paper
https://portal.mardi4nfdi.de/entity/Q34239702007-02-15Paper
https://portal.mardi4nfdi.de/entity/Q54879242006-09-13Paper
https://portal.mardi4nfdi.de/entity/Q54806882006-08-03Paper
https://portal.mardi4nfdi.de/entity/Q33782642006-03-30Paper
Connected Domatic Number in Planar Graphs2006-02-14Paper
https://portal.mardi4nfdi.de/entity/Q54635592005-08-04Paper
On dominating the Cartesian product of a graph and K22005-04-19Paper
https://portal.mardi4nfdi.de/entity/Q48261732004-11-11Paper
Improving some bounds for dominating Cartesian products2004-10-27Paper
https://portal.mardi4nfdi.de/entity/Q44703642004-06-22Paper
https://portal.mardi4nfdi.de/entity/Q44577432004-03-25Paper
Well-located graphs: A collection of well-covered ones2004-02-14Paper
On well-covered triangulations. I2003-12-04Paper
https://portal.mardi4nfdi.de/entity/Q45521722002-08-29Paper
Characterization of \(Z_m\)-well-covered graphs for some classes of graphs2002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q45049082001-05-28Paper
A bound on the size of a graph with given order and bondage number2001-05-17Paper
https://portal.mardi4nfdi.de/entity/Q27165362001-05-16Paper
https://portal.mardi4nfdi.de/entity/Q44892092001-01-14Paper
https://portal.mardi4nfdi.de/entity/Q44892472000-12-13Paper
A characterization of Zm-well-covered graphs of girth 6 or more2000-09-15Paper
https://portal.mardi4nfdi.de/entity/Q49435292000-06-09Paper
https://portal.mardi4nfdi.de/entity/Q49400162000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q49400732000-03-01Paper
https://portal.mardi4nfdi.de/entity/Q42430552000-01-30Paper
https://portal.mardi4nfdi.de/entity/Q42560001999-12-05Paper
Paired-domination1999-07-19Paper
https://portal.mardi4nfdi.de/entity/Q43933401998-11-08Paper
https://portal.mardi4nfdi.de/entity/Q38384211998-10-25Paper
https://portal.mardi4nfdi.de/entity/Q43797381998-06-29Paper
https://portal.mardi4nfdi.de/entity/Q43786281998-03-05Paper
https://portal.mardi4nfdi.de/entity/Q52840841997-05-19Paper
On 4-connected claw-free well-covered graphs1997-04-07Paper
https://portal.mardi4nfdi.de/entity/Q48949981997-01-26Paper
Vizing's conjecture and the one-half argument1996-08-20Paper
Star-factors andk-bounded total domination1996-08-05Paper
https://portal.mardi4nfdi.de/entity/Q48566281996-05-30Paper
https://portal.mardi4nfdi.de/entity/Q48546341996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48634361996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q48737381996-04-22Paper
https://portal.mardi4nfdi.de/entity/Q46975701995-10-05Paper
A characterization of well‐covered graphs that contain neither 4‐ nor 5‐cycles1995-04-04Paper
https://portal.mardi4nfdi.de/entity/Q43018941994-10-03Paper
Bounds on the bondage number of a graph1994-09-15Paper
Graphs whose vertex independence number is unaffected by single edge addition or deletion1994-07-24Paper
A characterization of graphs of girth eight or more with exactly two sizes of maximal independent sets1994-06-09Paper
https://portal.mardi4nfdi.de/entity/Q40284671993-03-28Paper
A characterization of well covered graphs of girth 5 or greater1993-03-10Paper
https://portal.mardi4nfdi.de/entity/Q40273321993-02-21Paper
https://portal.mardi4nfdi.de/entity/Q40142941992-10-06Paper
On minimal neighbourhood-connected graphs1992-06-28Paper
https://portal.mardi4nfdi.de/entity/Q33609141990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32113441989-01-01Paper
On designing a network to defend against random attacks of radius two1989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37972341988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38280431988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37865021987-01-01Paper
Neighbor-connected graphs and projective planes1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37303811985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37927111985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q51847001983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33239721982-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39505861981-01-01Paper
Optimal K-secure graphs1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38841541979-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41906711979-01-01Paper
A linear algorithm for disjoint matchings in trees1978-01-01Paper
Edge partitions of complete multipartite graphs into equal length circuits1977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41219371977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41949951977-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40934841976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41031161976-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40857561975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41321411975-01-01Paper
https://portal.mardi4nfdi.de/entity/Q40521521974-01-01Paper

Research outcomes over time

This page was built for person: Bert L. Hartnell