A panconnectivity theorem for bipartite graphs (Q2411610): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.disc.2017.08.024 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2755469081 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Biclosure and bistability in a balanced bipartite graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3158579 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Locating pairs of vertices on a Hamiltonian cycle in bigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnectivity and edge-pancyclicity of<i>k</i>-ary<i>n</i>-cubes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Long cycles in bipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2839907 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Panconnected graphs. II / rank
 
Normal rank

Revision as of 14:31, 14 July 2024

scientific article
Language Label Description Also known as
English
A panconnectivity theorem for bipartite graphs
scientific article

    Statements

    A panconnectivity theorem for bipartite graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    24 October 2017
    0 references
    bipartite graph
    0 references
    circumference
    0 references
    panconnectivity
    0 references

    Identifiers