Hamilton-connected indices of graphs (Q1044954): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2008.06.030 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2045826679 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A reduction method to find spanning Eulerian subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs without spanning closed trails / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton cycles and closed trails in iterated line graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Hamiltonian Line-Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4404931 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3320425 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Eulerian and Hamiltonian Graphs and Line Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Hamiltonian index / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graph whose edges are in small cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: A simple upper bound for the hamiltonian index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian iterated line graphs / rank
 
Normal rank

Latest revision as of 07:51, 2 July 2024

scientific article
Language Label Description Also known as
English
Hamilton-connected indices of graphs
scientific article

    Statements

    Hamilton-connected indices of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    15 December 2009
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Hamilton-connected index
    0 references
    iterated line graph
    0 references
    diameter
    0 references
    maximum degree
    0 references
    connectivity
    0 references
    0 references