Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (Q477654): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import241208061232 (talk | contribs)
Normalize DOI.
 
(6 intermediate revisions by 6 users not shown)
Property / DOI
 
Property / DOI: 10.1016/j.ipl.2014.09.025 / rank
Normal rank
 
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C10 / rank
 
Normal rank
Property / Mathematics Subject Classification ID
 
Property / Mathematics Subject Classification ID: 05C15 / rank
 
Normal rank
Property / zbMATH DE Number
 
Property / zbMATH DE Number: 6378667 / rank
 
Normal rank
Property / zbMATH Keywords
 
combinatorial problems
Property / zbMATH Keywords: combinatorial problems / rank
 
Normal rank
Property / zbMATH Keywords
 
planar bipartite graphs
Property / zbMATH Keywords: planar bipartite graphs / rank
 
Normal rank
Property / zbMATH Keywords
 
adjacent-vertex-distinguishing proper edge coloring
Property / zbMATH Keywords: adjacent-vertex-distinguishing proper edge coloring / rank
 
Normal rank
Property / zbMATH Keywords
 
adjacent-vertex-distinguishing proper edge chromatic number
Property / zbMATH Keywords: adjacent-vertex-distinguishing proper edge chromatic number / rank
 
Normal rank
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.ipl.2014.09.025 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2027629310 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex distinguishing colorings of graphs with \(\Delta(G)=2\) / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent Vertex Distinguishing Edge‐Colorings / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the vertex-distinguishing proper edge-colorings of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5422499 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the neighbour-distinguishing index of a graph / rank
 
Normal rank
Property / cites work
 
Property / cites work: Adjacent strong edge coloring of graphs / rank
 
Normal rank
Property / DOI
 
Property / DOI: 10.1016/J.IPL.2014.09.025 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 18:41, 9 December 2024

scientific article
Language Label Description Also known as
English
Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\)
scientific article

    Statements

    Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\) (English)
    0 references
    0 references
    0 references
    9 December 2014
    0 references
    combinatorial problems
    0 references
    planar bipartite graphs
    0 references
    adjacent-vertex-distinguishing proper edge coloring
    0 references
    adjacent-vertex-distinguishing proper edge chromatic number
    0 references

    Identifiers